No label defined (Q3770600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4029664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4029664 |
Statements
1987
0 references
generalized Fibonacci sequence
0 references
Hoggatt sequences
0 references
Zeckendorf representation
0 references
lexicographic ordering
0 references
If \(r\geq 2\) is a fixed integer the generalized Fibonacci sequence \(\{R_ n\}\) associated with r is defined as follows: \(R_ 1=1\); \(R_ j=2^{j- 2}\) for \(j=2,3,...,r\); \(R_{k+r}=R_{k+r-1}+R_{k+r-2}+...+R_ k\) for \(k=1,2,... \). The Hoggatt sequence of degree r, denoted by \(\{R^*_ n\}\), is defined by \(R^*_ n=R_{n+2}-R_{n+1}\) for \(n=1,2,... \). The Hoggatt sequence of degree 2 is the classical Fibonacci sequence, and for \(r\geq 2\{R_ n\}\) and \(\{R^*_ n\}\) satisfy the same recursion relation. In the present paper it is proved that the Hoggatt sequences have properties similar to those of the generalized Fibonacci sequences. In particular it is proved that every positive integer has a unique Zeckendorf representation in terms of \(\{R^*_ n\}\) and this representation is a lexicographic ordering. Special attention is paid to the case \(r=3\).
0 references