A059319 Number of 1's in row n of Pascal's rhombus mod 2.

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, 15, 17, 24, 13, 43, 14, 33, 19, 20, 23, 45, 14, 55, 17, 48, 29, 35, 24, 27, 19, 42, 21, 21, 28, 45, 27, 36, 15, 33, 14, 51, 25, 40, 37, 39, 30, 85, 33, 42, 43, 55, 34, 57, 19, 44, 23, 69

Offset: 0

Author

N. J. A. Sloane, Jan 26 2001

Keywords

• easy
• nonn

Comments

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

References

• 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.

Links

• Steven R. Finch, P. Sebah and Z.-Q. Bai, Odd Entries in Pascal's Trinomial Triangle, arXiv:0802.2654 [math.NT], 2008.
• J. Goldwasser et al., The density of ones in Pascal's rhombus, Discrete Math., 204 (1999), 231-236.
• Robert Price, Number of ON cells at each generation of RCA(3)
• Paul K. Stockmeyer, The Pascal Rhombus and the Stealth Configuration, arXiv:1504.04404 [math.CO], 2015.
• Index entries for sequences related to cellular automata
• Index to Elementary Cellular Automata

Crossrefs

Cf. A059317, A059318, A059320, A007318.

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Jan 30 2001