|
Search: id:A160802
|
|
|
| A160802 |
|
Toothpick sequence in Fibonacci spiral (see Comments lines for definition). |
|
+0
5
|
|
| 0, 1, 3, 7, 11, 15, 21, 25, 28, 30, 33, 37, 38
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
On the infinite square grid we draw a Fibonacci spiral starting with 3,3,6,9,15,24,... (Note that each edge has length = A000045(k)*3, 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. A160803 (the first differences) gives the number added at the n-th stage. See A160800 and A139250 for more information about toothpick sequences.
|
|
LINKS
|
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
|
|
CROSSREFS
|
Cf. A000045, A139250, A139251, A160426, A160427, A160800, A160801, A160803.
Sequence in context: A079422 A022797 A109507 this_sequence A163094 A022800 A071849
Adjacent sequences: A160799 A160800 A160801 this_sequence A160803 A160804 A160805
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Omar E. Pol (info(AT)polprimos.com), May 26 2009
|
|
|
Search completed in 0.002 seconds
|
