A266849 Binary representation of the n-th iteration of the "Rule 71" elementary cellular automaton starting with a single ON (black) cell.

1, 110, 100, 1111011, 10000, 11111101111, 1000000, 111111110111111, 100000000, 1111111111011111111, 10000000000, 11111111111101111111111, 1000000000000, 111111111111110111111111111, 100000000000000, 1111111111111111011111111111111, 10000000000000000

Offset

0,2

Links

Robert Price, Table of n, a(n) for n = 0..1000

Eric Weisstein's World of Mathematics, Elementary Cellular Automaton

Stephen Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.

Index entries for sequences related to cellular automata

Index to Elementary Cellular Automata

Formula

Conjectures from Colin Barker, Jan 05 2016 and Apr 18 2019: (Start)

a(n) = 10101*a(n-2)-1010100*a(n-4)+1000000*a(n-6) for n>5.

G.f.: (1+110*x-10001*x^2-99*x^3+10000*x^4-110000*x^5) / ((1-x)*(1+x)*(1-10*x)*(1+10*x)*(1-100*x)*(1+100*x)).

(End)

Mathematica

rule=71; 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

Cf. A266848, A266850.

Sequence in context: A247391 A110736 A084292 * A278758 A171797 A281173

Adjacent sequences: A266846 A266847 A266848 * A266850 A266851 A266852

Keyword

nonn,easy

Author

Robert Price, Jan 04 2016

Status

approved