login
A267684
Binary representation of the n-th iteration of the "Rule 203" elementary cellular automaton starting with a single ON (black) cell.
3
1, 100, 11011, 1110111, 111101111, 11111011111, 1111110111111, 111111101111111, 11111111011111111, 1111111110111111111, 111111111101111111111, 11111111111011111111111, 1111111111110111111111111, 111111111111101111111111111, 11111111111111011111111111111
OFFSET
0,2
REFERENCES
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
FORMULA
Conjectures from Colin Barker, Jan 19 2016 and Apr 17 2019: (Start)
a(n) = 111*a(n-1)-1110*a(n-2)+1000*a(n-3) for n>4.
G.f.: (1-11*x+1021*x^2-2110*x^3+1000*x^4) / ((1-x)*(1-10*x)*(1-100*x)).
(End)
MATHEMATICA
rule=203; 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]]], {k, 1, rows}] (* Binary Representation of Rows *)
CROSSREFS
Sequence in context: A272681 A267674 A267846 * A267885 A307810 A151648
KEYWORD
nonn,easy
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