|
%I #14 Jun 28 2015 15:28:18
%S 1,1,1,1,1,1,1,1,4,4,4,4,5,1,1,1,12,12,12,12,8,8,8,8,55,28,28,28,30,1,
%T 1,1,28,28,28,28,24,24,24,24,116,124,124,124,16,16,16,16,162,252,252,
%U 252,56,56,56,56,461,60,60,60,1,1,1,1,60,60,60,60,56,56
%N Consider the cellular automaton defined by rule 22 in a finite, circular universe of width n. Then a single live cell eventually becomes an oscillator of period a(n).
%H Alois P. Heinz, <a href="/A174444/b174444.txt">Table of n, a(n) for n = 1..184</a>
%e For n=9, start with a 9-cell wide grid, and assume that the edges wrap around. In generation 0, the pattern is 000010000
%e The progression is
%e 000010000
%e 000111000
%e 001000100
%e 011101110
%e 100000001
%e 010000010
%e 111000111
%e 000101000
%e 001101100
%e 010000010
%e At which point the pattern becomes an oscillator of period 4. Thus, a(9)=4.
%K nonn
%O 1,9
%A _Ben Branman_, Nov 28 2010
%E More terms from _Alois P. Heinz_, Jan 17 2011
|
