login
Binary representation of generation n in the reversible cellular automaton RCA(2) when started with a single ON cell at generation 0.
3

%I #7 Mar 23 2017 21:26:27

%S 1,11,1,1111,10101,11,1010001,11111111,1000101,1100110011,10001000001,

%T 1111,1000100010101,11001100000011,1000101010001,1111111111111111,

%U 10100010101000101,11000000110011,1010100010101000001,11110000111100001111,1000000010000010101

%N Binary representation of generation n in the reversible cellular automaton RCA(2) when started with a single ON cell at generation 0.

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

%H Alan J. Macfarlane, <a href="https://doi.org/10.1088/0305-4470/37/45/006">Linear reversible second-order cellular automata and their first-order matrix equivalents</a>, Journal of Physics A: Mathematical and General 37.45 (2004): 10791. See Fig. 3.

%H Robert Price, <a href="/A284232/a284232.bfile.txt">Diagram of the first 35 generations</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>

%e The fourth generation (starting at 0) of RCA(2) is x.x.x where "x" is an ON cell and "." is OFF. Treating this as a binary number yields 10101. Thus a(4) = 10101.

%Y Cf. A283324, A284234.

%K nonn,more

%O 0,2

%A _Robert Price_, Mar 23 2017