A046819 - OEIS

This site is supported by donations to The OEIS Foundation.

A046819

Number of 1's in binary expansion of 3n+2.

1, 2, 1, 3, 3, 2, 2, 4, 3, 4, 1, 3, 3, 3, 3, 5, 3, 4, 3, 5, 5, 2, 2, 4, 3, 4, 2, 4, 4, 4, 4, 6, 3, 4, 3, 5, 5, 4, 4, 6, 5, 6, 1, 3, 3, 3, 3, 5, 3, 4, 3, 5, 5, 3, 3, 5, 4, 5, 3, 5, 5, 5, 5, 7, 3, 4, 3, 5, 5, 4, 4, 6, 5, 6, 3, 5, 5, 5, 5, 7, 5, 6, 5, 7, 7, 2, 2, 4, 3, 4, 2, 4, 4 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	LINKS	`S. R. Finch, P. Sebah and Z.-Q. Bai, Odd Entries in Pascal's Trinomial Triangle (arXiv:0802.2654)`
	FORMULA	`a(2n+1) = a(n) + 1, since 6n+5 = 2(3n+2)+1. - Ralf Stephan, Mar 05 2004`
	CROSSREFS	`Sequence in context: A179480 A035050 A198790 * A159945 A089216 A102746` `Adjacent sequences: A046816 A046817 A046818 * A046820 A046821 A046822`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 14:35 EST 2012. Contains 205820 sequences.