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

1, 110, 11000, 1100110, 110010000, 11001101110, 1100100001000, 110011011110110, 11001000011000000, 1100110111000111110, 110010000100110111000, 11001101111010000100110, 1100100001100101111010000, 110011011100011001100101110, 11001000010011000100011001000

Offset

0,2

References

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

Links

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

Eric Weisstein's World of Mathematics, Elementary Cellular Automaton

Index entries for sequences related to cellular automata

Index to Elementary Cellular Automata

Mathematica

rule = 135; rows = 20; Table[FromDigits[Table[Take[CellularAutomaton[rule, {{1}, 0}, rows-1, {All, All}][[k]], {rows-k+1, rows+k-1}], {k, 1, rows}][[k]]], {k, 1, rows}]

Crossrefs

Cf. A265695.

Sequence in context: A267854 A135645 A266299 * A267535 A267577 A262779

Adjacent sequences: A265693 A265694 A265695 * A265697 A265698 A265699

Keyword

nonn,easy

Author

Robert Price, Dec 13 2015

Status

approved