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

1, 0, 101, 111, 1101111, 10111111, 10011111111, 111111111, 111101111111111, 1110111111111111, 1011011111111111111, 1101111111111111111, 11010111111111111111111, 101011111111111111111111, 100101111111111111111111111, 111111111111111111111111

Offset

0,3

References

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

Links

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

Eric Weisstein's World of Mathematics, Elementary Cellular Automaton

S. Wolfram, A New Kind of Science

Index entries for sequences related to cellular automata

Index to Elementary Cellular Automata

Mathematica

rule=169; 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. A264442.

Sequence in context: A279250 A279057 A284404 * A294743 A352439 A214527

Adjacent sequences: A267582 A267583 A267584 * A267586 A267587 A267588

Keyword

nonn,easy,changed

Author

Robert Price, Jan 18 2016

Status

approved