|
Search: id:A160808
|
|
|
| A160808 |
|
Toothpick sequence in Fibonacci spiral (see Comments lines for definition). |
|
+0
3
|
|
| 0, 1, 3, 7, 11, 15, 23, 35, 39, 40, 42, 45, 48, 52, 59, 67, 68
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
On the infinite square grid we draw a Fibonacci spiral starting with 4,4,8,12,20,32,... (Note that each edge has length = A000045(k)*4, for k>0). We start at stage 0 with no toothpicks. At stage 1 we place a toothpick of length 2 in a orthogonal direction, in the center of the Fibonacci spiral. At stage 2 we place 2 toothpicks. And so on... The sequence gives the number of toothpicks in the Fibonacci spiral after n stages. A160809 (the first differences) gives the number added at the n-th stage. See 160800, A160802 and A139250 for more information about toothpick sequences.
|
|
CROSSREFS
|
Cf. A000045, A139250, A139251, A160426, A160427, A160800, A160801, A160802, A160803, A160809.
Sequence in context: A095100 A036994 A112714 this_sequence A151567 A139250 A145052
Adjacent sequences: A160805 A160806 A160807 this_sequence A160809 A160810 A160811
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Omar E. Pol (info(AT)polprimos.com), May 26 2009
|
|
|
Search completed in 0.002 seconds
|
