|
Search: id:A047924
|
|
|
| A047924 |
|
a(n) = B_{A_n+1}+1, where A_n = floor(n*phi), B_n = floor(n*phi^2) and phi is the golden ratio. |
|
+0
2
|
|
| 3, 6, 11, 14, 19, 24, 27, 32, 35, 40, 45, 48, 53, 58, 61, 66, 69, 74, 79, 82, 87, 90, 95, 100, 103, 108, 113, 116, 121, 124, 129, 134, 137, 142, 147, 150, 155, 158, 163, 168, 171, 176, 179, 184, 189, 192, 197, 202, 205, 210, 213, 218, 223, 226, 231, 234, 239
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
2nd column of array in A038150.
|
|
REFERENCES
|
A. S. Fraenkel, Recent results and questions in combinatorial game complexities, Theoretical Computer Science, vol. 249, no. 2 (2000), 265-288.
|
|
LINKS
|
A. S. Fraenkel, Arrays, numeration systems and Frankenstein games, Theoret. Comput. Sci. 282 (2002), 271-284.
|
|
CROSSREFS
|
Sequence in context: A063275 A026368 A047398 this_sequence A015823 A049620 A056232
Adjacent sequences: A047921 A047922 A047923 this_sequence A047925 A047926 A047927
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jun 08 2001
New description from Aviezri Fraenkel (aviezri.fraenkel(AT)weizmann.ac.il), Aug 03 2007
|
|
|
Search completed in 0.002 seconds
|
