[go: up one dir, main page]

login
A267688
Binary representation of the n-th iteration of the "Rule 199" elementary cellular automaton starting with a single ON (black) cell.
2
1, 110, 11100, 1111010, 111110100, 11111101010, 1111111010100, 111111110101010, 11111111101010100, 1111111111010101010, 111111111110101010100, 11111111111101010101010, 1111111111111010101010100, 111111111111110101010101010, 11111111111111101010101010100
OFFSET
0,2
REFERENCES
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
FORMULA
Conjectures from Colin Barker, Jan 19 2016: (Start)
a(n) = 110*a(n-1) - 999*a(n-2) - 110*a(n-3) + 1000*a(n-4) for n > 4.
G.f.: (1 - x^2 + 10*x^3 - 1000*x^4) / ((1-x)*(1+x)*(1-10*x)*(1-100*x)).
(End)
MATHEMATICA
rule=199; 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: A265320 A109241 A090490 * A211979 A135650 A193240
KEYWORD
nonn
AUTHOR
Robert Price, Jan 19 2016
STATUS
approved