|
|
A071049
|
|
Number of 1's in n-th generation of 1-D CA using Rule 110, started with a single 1.
|
|
7
|
|
|
1, 2, 3, 3, 5, 3, 5, 6, 8, 5, 6, 8, 8, 8, 11, 11, 13, 9, 11, 11, 13, 14, 16, 14, 14, 13, 13, 17, 22, 20, 16, 17, 24, 19, 14, 19, 25, 18, 20, 25, 24, 19, 24, 31, 27, 26, 24, 22, 32, 31, 28, 24, 29, 34, 30, 31, 37, 34, 34, 36, 35, 34, 35, 36, 43, 40, 36, 38, 37, 39, 40
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Number of 1's in n-th row of triangle in A070887.
Although the initial behavior is chaotic, it is an astonishing fact, pointed out by Wolfram [2002, p. 39], that after about three thousand terms all the irregularities disappear. - N. J. A. Sloane, May 15 2015
|
|
REFERENCES
|
Matthew Cook, A Concrete View of Rule 110 Computation, in "The Complexity of Simple Programs", T. Neary, D. Woods, A. K. Seda, and N. Murphy (Eds.), 2008, pp. 31-55.
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; Chapter 3.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Rule 110
|
|
FORMULA
|
For n >= 2854, a(n+469) = -a(n+453) + a(n+256) + a(n+240) + a(n+229) + a(n+213) - a(n+16) - a(n). - N. J. A. Sloane, May 15 2015
|
|
MAPLE
|
end proc:
|
|
MATHEMATICA
|
Total /@ CellularAutomaton[110, {{1}, 0}, 100] (* N. J. A. Sloane, Aug 10 2009 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|