A173456 Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition).
0, 1, 9, 21, 25, 53, 89, 93, 121, 157, 169, 253, 361, 365, 393, 429, 441, 525, 633, 645, 729, 837, 873, 1125, 1449, 1453, 1481, 1517, 1529, 1613, 1721, 1733, 1817, 1925, 1961, 2213, 2537, 2549, 2633, 2741, 2777, 3029, 3353, 3389, 3641, 3965, 4073, 4829, 5801
Offset: 0
Keywords
Examples
Array begins: 0, 1, 9; 21, 25, 53; 89, 93, 121; 157, 169, 253; 361, 365, 393; ... If we label the generations of cells turned ON by consecutive numbers we get the cell pattern shown below: 7...........7 .66.66.66.66. .65556.65556. ..545...545.. .65533.33556. .66.32223.66. .....212..... .66.32223.66. .65533.33556. ..545...545.. .65556.65556. .66.66.66.66. 7...........7
Links
- Lars Blomberg, Table of n, a(n) for n = 0..5999
- David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
- N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Formula
a(0)=0, a(n)=a(n-1)+A173457(n), n>=1
Extensions
a(41)-a(48) from Lars Blomberg, Apr 22 2013
Comments