|
%I #17 Jul 12 2017 06:05:32
%S 1,8,8,28,8,64,28,128,8,64,64,224,28,224,128,480,8,64,64,224,64,512,
%T 224,1024,28,224,224,784,128,1024,480,2008,8,64,64,224,64,512,224,
%U 1024,64,512,512,1792,224,1792,1024,3840,28,224,224,784,224
%N Number of odd terms in f^n, where f = (1/x+1+x)*(1/y+1+y)-y/x.
%C This is the number of ON cells in a certain two-dimensional cellular automaton in which the neighborhood of a cell is defined by f, and in which a cell is ON iff there were an odd number of ON cells in the neighborhood at the previous generation.
%C This is the odd-rule cellular automaton defined by OddRule 377 (see Ekhad-Sloane-Zeilberger "Odd-Rule Cellular Automata on the Square Grid" link).
%H Shalosh B. Ekhad, N. J. A. Sloane, and Doron Zeilberger, <a href="http://arxiv.org/abs/1503.01796">A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata</a>, arXiv:1503.01796, 2015; see also the <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/CAcount.html">Accompanying Maple Package</a>.
%H Shalosh B. Ekhad, N. J. A. Sloane, and Doron Zeilberger, <a href="http://arxiv.org/abs/1503.04249">Odd-Rule Cellular Automata on the Square Grid</a>, arXiv:1503.04249, 2015.
%H N. J. A. Sloane, On the No. of ON Cells in Cellular Automata, Video of talk in Doron Zeilberger's Experimental Math Seminar at Rutgers University, Feb. 05 2015: <a href="https://vimeo.com/119073818">Part 1</a>, <a href="https://vimeo.com/119073819">Part 2</a>
%H N. J. A. Sloane, <a href="http://arxiv.org/abs/1503.01168">On the Number of ON Cells in Cellular Automata</a>, arXiv:1503.01168, 2015
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%F This is the Run Length Transform of A255276.
%e Here is the neighborhood f:
%e [0, X, X]
%e [X, X, X]
%e [X, X, X]
%e which contains a(1) = 8 ON cells.
%t (* f = A255276 *) f[0]=1; f[1]=8; f[2]=28; f[3]=128; f[4]=480; f[5]=2008; f[6]=7776; f[n_] := f[n] = -32f[n-8] - 24f[n-7] + 164f[n-6] - 236f[n-5] + 145f[n-4] - 24f[n-3] - 16f[n-2] + 8f[n-1]; Table[Times @@ (f[Length[#]]&) /@ Select[ Split[ IntegerDigits[n, 2]], #[[1]] == 1&], {n, 0, 52}] (* _Jean-François Alcover_, Jul 12 2017 *)
%Y Cf. A255276.
%K nonn
%O 0,2
%A _N. J. A. Sloane_ and _Doron Zeilberger_, Feb 19 2015
|
