A note on the recursive sequence xn+1 = pkxn + pk-1xn-1+...+ p1xn-k+1

DC Field	Value	Language
dc.contributor.author	Stević, Stevo	en
dc.date.accessioned	2020-05-01T20:13:48Z	-
dc.date.available	2020-05-01T20:13:48Z	-
dc.date.issued	2003-12-01	en
dc.identifier.issn	0041-5995	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1712	-
dc.description.abstract	We present some comments on the behavior of solutions of the difference equation xn+1 = pkxn + pk-1xn-1 + ... + p1xn-k+1, n = - 1, 0, 1, ..., where pi ≥ 0, i = 1, ..., k, k ∈ N, and x-k,..., x-1 ∈ R.	en
dc.publisher	Springer Link	-
dc.relation.ispartof	Ukrainian Mathematical Journal	en
dc.title	A note on the recursive sequence xn+1 = pkxn + pk-1xn-1+...+ p1xn-k+1	en
dc.type	Article	en
dc.identifier.doi	10.1023/B:UKMA.0000010169.93540.c2	-
dc.identifier.scopus	2-s2.0-24044436049	en
dc.relation.firstpage	691	en
dc.relation.lastpage	697	en
dc.relation.issue	4	en
dc.relation.volume	55	en
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.cerifentitytype	Publications	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-
crisitem.author.orcid	0000-0002-7202-9764	-

10

checked on Nov 24, 2024

14

checked on Nov 24, 2024

Check