login
A267595
Binary representation of the n-th iteration of the "Rule 173" elementary cellular automaton starting with a single ON (black) cell.
2
1, 10, 1111, 111111, 11111111, 1111111111, 111111111111, 11111111111111, 1111111111111111, 111111111111111111, 11111111111111111111, 1111111111111111111111, 111111111111111111111111, 11111111111111111111111111, 1111111111111111111111111111
OFFSET
0,2
FORMULA
Conjectures from Colin Barker, Jan 18 2016 and Apr 20 2019: (Start)
a(n) = 101*a(n-1)-100*a(n-2) for n>3.
G.f.: (1-91*x+201*x^2-100*x^3) / ((1-x)*(1-100*x)).
(End)
MATHEMATICA
rule=173; 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: A266589 A015026 A130598 * A266621 A110731 A223119
KEYWORD
nonn,easy
AUTHOR
Robert Price, Jan 18 2016
STATUS
approved