login
A267057
Binary representation of the n-th iteration of the "Rule 97" elementary cellular automaton starting with a single ON (black) cell.
2
1, 0, 10100, 10011, 100000000, 11111111, 1010000000000, 1001111111111, 10000000000000000, 1111111111111111, 101000000000000000000, 100111111111111111111, 1000000000000000000000000, 111111111111111111111111, 10100000000000000000000000000
OFFSET
0,3
REFERENCES
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
FORMULA
Conjectures from Colin Barker, Jan 10 2016 and Apr 19 2019: (Start)
a(n) = a(n-2)+100000000*a(n-4)-100000000*a(n-6) for n>5.
G.f.: (1+10099*x^2+10011*x^3-10100*x^4+11101100*x^5) / ((1-x)*(1+x)*(1-100*x)*(1+100*x)*(1+10000*x^2)).
(End)
MATHEMATICA
rule=97; 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: A083965 A161022 A293686 * A213182 A213184 A267645
KEYWORD
nonn,easy
AUTHOR
Robert Price, Jan 09 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