Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #25 Dec 18 2024 15:05:11
%S 1,3,2,5,5,6,3,11,4,15,7,10,9,9,8,21,11,12,15,25,16,21,9,22,7,27,12,
%T 15,17,24,13,43,14,33,19,20,23,45,14,55,17,48,29,35,24,27,19,42,21,21,
%U 28,45,27,36,15,33,14,51,25,40,37,39,30,85,33,42,43,55,34,57,19,44,23,69
%N Number of 1's in row n of Pascal's rhombus mod 2.
%C Also number of ON cells at generation n in the reversible cellular automaton RCA(3) when started with a single ON cell at generation 0. - _N. J. A. Sloane_, Mar 16 2017
%D Macfarlane, Alan J. "Linear reversible second-order cellular automata and their first-order matrix equivalents." Journal of Physics A: Mathematical and General 37.45 (2004): 10791. See Fig. 4.
%H Steven R. Finch, P. Sebah and Z.-Q. Bai, <a href="http://arXiv.org/abs/0802.2654">Odd Entries in Pascal's Trinomial Triangle</a>, arXiv:0802.2654 [math.NT], 2008.
%H J. Goldwasser et al., <a href="http://dx.doi.org/10.1016/S0012-365X(98)00373-2">The density of ones in Pascal's rhombus</a>, Discrete Math., 204 (1999), 231-236.
%H Robert Price, <a href="/A059319/a059319.bfile.txt">Number of ON cells at each generation of RCA(3)</a>
%H Paul K. Stockmeyer, <a href="http://arxiv.org/abs/1504.04404">The Pascal Rhombus and the Stealth Configuration</a>, arXiv:1504.04404 [math.CO], 2015.
%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>
%Y Cf. A059317, A059318, A059320, A007318.
%K easy,nonn,changed
%O 0,2
%A _N. J. A. Sloane_, Jan 26 2001
%E More terms from Larry Reeves (larryr(AT)acm.org), Jan 30 2001