A245549 State of one-dimensional cellular automaton 'sigma' (Rule 30): 000,001,010,011,100,101,110,111 -> 0,0,0,1,1,1,1,0 at generation n, regarded as a binary number.

1, 111, 11001, 1101111, 110010001, 11011110111, 1100100001001, 110111100111111, 11001000111000001, 1101111011001000111, 110010000101111011001, 11011110011010000101111

Offset: 0

Author

N. J. A. Sloane, Jul 28 2014

Keywords

• nonn

Comments

See A110240 for decimal equivalents. See A070952 for number of ON cells.

Links

• Robert Price, Table of n, a(n) for n = 0..999
• N. J. A. Sloane, Illustration of first 20 generations
• Eric Weisstein's World of Mathematics, Rule 150
• S. Wolfram, A New Kind of Science
• Index entries for sequences related to cellular automata
• Index to Elementary Cellular Automata

Crossrefs

Cf. A070952, A110240, A070950, A074890, A269160.

Programs

Mathematica

rule=30; 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 *)(* Robert Price, Feb 21 2016 *)