OFFSET
0,2
COMMENTS
This is the number of cells that are ON after n generations in a two-dimensional cellular automaton defined by the odd-neighbor rule where the neighborhood consists of a 5X5 block of contiguous cells.
LINKS
Chai Wah Wu, Table of n, a(n) for n = 0..200
N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168, 2015
FORMULA
The values of a(n) for n in A247647 (or A247648) determine all the values, as follows. Parse the binary expansion of n into terms from A247647 separated by at least two zeros: m_1 0...0 m_2 0...0 m_3 ... m_r 0...0. Ignore any number (one or more) of trailing zeros. Then a(n) = a(m_1)*a(m_2)*...*a(m_r). For example, n = 37_10 = 100101_2 is parsed into 1.00.101, and so a(37) = a(1)*a(5) = 25*289 = 7225. This is a generalization of the Run Length Transform.
PROG
(Python)
import sympy
from operator import mul
from functools import reduce
x, y = sympy.symbols('x y')
f = ((1/x**2+1/x+1+x+x**2)*(1/y**2+1/y+1+y+y**2)).expand(modulus=2)
A247650_list, g = [1], 1
for n in range(1, 101):
s = [int(d, 2) for d in bin(n)[2:].split('00') if d != '']
g = (g*f).expand(modulus=2)
if len(s) == 1:
A247650_list.append(g.subs([(x, 1), (y, 1)]))
else:
# Chai Wah Wu, Sep 25 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 25 2014
STATUS
approved