|
Search: id:A020942
|
|
|
| A020942 |
|
First column of 3rd-order Zeckendorf array. |
|
+0
7
|
|
| 1, 5, 7, 10, 14, 18, 20, 24, 26, 29, 33, 35, 38, 42, 46, 48, 51, 55, 59, 61, 65, 67, 70, 74, 78, 80, 84, 86, 89, 93, 95, 98, 102, 106, 108, 112, 114, 117, 121, 123, 126, 130, 134, 136, 139, 143, 147, 149, 153, 155, 158, 162, 164, 167, 171, 175, 177, 180, 184
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
I would like to get similar sequences where the least term in the representation is 2 [ gives 2 8 11 15 21 27 30... ], 3, 4, 6, etc. They are the 2nd, 3rd, etc. columns of the 3rd-order Zeckendorf array.
|
|
REFERENCES
|
C. Kimberling, "The Zeckendorf array equals the Wythoff array," Fibonacci Quarterly 33 (1995) 3-8.
|
|
FORMULA
|
Any number n has unique representation as a sum of terms from {1, 2, 3, 4, 6, 9, 13, 19, ...} (cf. A000930) such that no two terms are adjacent or pen-adjacent; e.g. 7=6+1. Sequence gives all n where that representation involves 1.
|
|
EXAMPLE
|
1=1; 5=4+1; 7=6+1; 10=9+1; etc.
|
|
CROSSREFS
|
Sequence in context: A025074 A065503 A022441 this_sequence A071911 A070875 A091522
Adjacent sequences: A020939 A020940 A020941 this_sequence A020943 A020944 A020945
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Sep 17 2001
|
|
|
Search completed in 0.002 seconds
|
