This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265319 Binary representation of the n-th iteration of the "Rule 102" elementary cellular automaton starting with a single ON (black) cell. 1

%I

%S 1,110,10100,1111000,100010000,11001100000,1010101000000,

%T 111111110000000,10000000100000000,1100000011000000000,

%U 101000001010000000000,11110000111100000000000,1000100010001000000000000,110011001100110000000000000,10101010101010100000000000000

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

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

%H Robert Price, <a href="/A265319/b265319.txt">Table of n, a(n) for n = 0..999</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>

%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>

%H <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>

%t rule = 102; 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}]

%Y Cf. A075439.

%K nonn,easy

%O 0,2

%A _Robert Price_, Dec 06 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 09:03 EDT 2019. Contains 322307 sequences. (Running on oeis4.)