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

1, 110, 110, 1110101, 111100, 11110001011, 101111000, 111111100010111, 1011110000, 1111111111000101111, 10111100000, 11111111111110001011111, 101111000000, 111111111111111100010111111, 1011110000000, 1111111111111111111000101111111, 10111100000000

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 11 2016 and Apr 19 2019: (Start)

a(n) = 10011*a(n-2) - 110010*a(n-4) + 100000*a(n-6) for n > 10.

G.f.: (1 + 110*x - 9901*x^2 + 8891*x^3 - 880100*x^4 + 8881000*x^5 - 999110000*x^6 + 10991100000*x^7 - 999000000000*x^8 - 11000000000*x^9 + 1000000000000*x^10) / ((1-x)*(1+x)*(1-100*x)*(1+100*x)*(1-10*x^2)). (End)

Mathematica

rule=103; 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. A267136, A267139.

Sequence in context: A281173 A281219 A266979 * A039724 A008944 A306701

Adjacent sequences: A267135 A267136 A267137 * A267139 A267140 A267141

Keyword

nonn,easy

Author

Robert Price, Jan 10 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