OFFSET
0,3
COMMENTS
The fact that only n cells to the left and right of the initially active cell are updated at step n (cf. A267679 for the binary representation) is contradictory to the usual treatment of a "Rule m" automaton, where all cells are updated depending on their neighborhood. See also the illustration of "Rule 201" on the MathWorld page. - M. F. Hasler, Jul 28 2018
REFERENCES
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
LINKS
Robert Price, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
S. Wolfram, A New Kind of Science
FORMULA
Conjectures from Colin Barker, Jan 19 2016: (Start)
a(n) = 5*a(n-1)-20*a(n-3)+16*a(n-4) for n>4.
G.f.: (1-5*x+21*x^2+14*x^3-40*x^4) / ((1-x)*(1-2*x)*(1+2*x)*(1-4*x)).
(End)
Conjecture: a(n) = 2*4^n - (n%2*2 + [n]*5)*2^(n-1) - 1, where [n] = 1 iff n > 0; n%2 = 1 iff n is odd. - M. F. Hasler, Jul 28 2018
MATHEMATICA
rule=201; rows=20; ca=CellularAutomaton[rule, {{1}, 0}, rows-1, {All, All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]], {rows-k+1, rows+k-1}], {k, 1, rows}]; (* Truncated list of each row *) Table[FromDigits[catri[[k]], 2], {k, 1, rows}] (* Decimal Representation of Rows *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Price, Jan 19 2016
EXTENSIONS
Removed an unjustified claim that Colin Barker's conjectures are correct. Removed a program based on a conjecture. - Michael De Vlieger, Jun 13 2022
STATUS
approved