login
A174444
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).
1
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, 1, 1, 28, 28, 28, 28, 24, 24, 24, 24, 116, 124, 124, 124, 16, 16, 16, 16, 162, 252, 252, 252, 56, 56, 56, 56, 461, 60, 60, 60, 1, 1, 1, 1, 60, 60, 60, 60, 56, 56
OFFSET
1,9
LINKS
EXAMPLE
For n=9, start with a 9-cell wide grid, and assume that the edges wrap around. In generation 0, the pattern is 000010000
The progression is
000010000
000111000
001000100
011101110
100000001
010000010
111000111
000101000
001101100
010000010
At which point the pattern becomes an oscillator of period 4. Thus, a(9)=4.
CROSSREFS
Sequence in context: A228423 A165923 A228729 * A268237 A276866 A331842
KEYWORD
nonn
AUTHOR
Ben Branman, Nov 28 2010
EXTENSIONS
More terms from Alois P. Heinz, Jan 17 2011
STATUS
approved