login
A267535
Binary representation of the n-th iteration of the "Rule 143" elementary cellular automaton starting with a single ON (black) cell.
3
1, 110, 11001, 1100111, 110011111, 11001111111, 1100111111111, 110011111111111, 11001111111111111, 1100111111111111111, 110011111111111111111, 11001111111111111111111, 1100111111111111111111111, 110011111111111111111111111, 11001111111111111111111111111
OFFSET
0,2
REFERENCES
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
FORMULA
Conjectures from Colin Barker, Jan 17 2016 and Apr 19 2019: (Start)
a(n) = 101*a(n-1)-100*a(n-2) for n>3.
G.f.: (1+10*x)*(1-x+x^2) / ((1-x)*(1-100*x)).
(End)
MATHEMATICA
rule=143; 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: A135645 A266299 A265696 * A267577 A262779 A058935
KEYWORD
nonn,easy
AUTHOR
Robert Price, Jan 16 2016
STATUS
approved