Afficher la notice abrégée
| dc.rights.license |
CC BY |
eng |
| dc.contributor.author |
Trojovský, Pavel |
cze |
| dc.date.accessioned |
2026-07-21T06:41:28Z |
|
| dc.date.available |
2026-07-21T06:41:28Z |
|
| dc.date.issued |
2021 |
eng |
| dc.identifier.issn |
2075-1680 |
eng |
| dc.identifier.uri |
http://hdl.handle.net/20.500.12603/2806 |
|
| dc.description.abstract |
For r >= 2 and a >= 1 integers, let (t(n)((r,a)))(n >= 1) be the sequence of the (r,a)-generalized Fibonacci numbers which is defined by the recurrence t(n)((r,a))=t(n-1)((r,a))+ . . .+t(n-r)((r,a)) for n>r, with initial values t(i)((r,a))=1, for all i is an element of[1,r-1] and t(r)((r,a))=a. In this paper, we shall prove (in particular) that, for any given r >= 2, there exists a positive proportion of positive integers which can not be written as t(n)((r,a)) for any (n,a)is an element of Z(>= r+2)xZ(>1). |
eng |
| dc.format |
p. "Article Number: 144" |
eng |
| dc.language.iso |
eng |
eng |
| dc.publisher |
MDPI-Molecular diversity preservation international |
eng |
| dc.relation.ispartof |
Axioms, volume 10, issue: 3 |
eng |
| dc.subject |
natural density |
eng |
| dc.subject |
Fibonacci r-numbers |
eng |
| dc.subject |
recurrence sequences |
eng |
| dc.title |
On the Natural Density of Sets Related to Generalized Fibonacci Numbers of Order r |
eng |
| dc.type |
article |
eng |
| dc.identifier.obd |
43878166 |
eng |
| dc.identifier.doi |
10.3390/axioms10030144 |
eng |
| dc.publicationstatus |
postprint |
eng |
| dc.peerreviewed |
yes |
eng |
| dc.source.url |
https://www.mdpi.com/2075-1680/10/3/144 |
cze |
| dc.relation.publisherversion |
https://www.mdpi.com/2075-1680/10/3/144 |
eng |
| dc.rights.access |
Open Access |
eng |
Fichier(s) constituant ce document
Ce document figure dans la(les) collection(s) suivante(s)
Afficher la notice abrégée