A265320 Binary representation of the n-th iteration of the "Rule 110" elementary cellular automaton starting with a single ON (black) cell.
1, 110, 11100, 1101000, 111110000, 11000100000, 1110011000000, 110101110000000, 11111110100000000, 1100000111000000000, 111000011010000000000, 11010001111100000000000, 1111100110001000000000000, 110001011100110000000000000, 11100111101011100000000000000
Offset: 0
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
Crossrefs
Cf. A075437.
Programs
-
Mathematica
rule = 110; 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}]