id:A101402 - OEIS Search Results

Search: id:A101402

Displaying 1-1 of 1 results found.

page 1

a(0)=0, a(1)=1; for n>=2, let k = smallest power of 2 that is >= n, then a(n) = a(k/2) + a(n-1-k/2).

+0
5

0, 1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 9, 9, 9, 9, 10, 10, 10, 11, 11, 12, 12, 13, 13, 13, 14, 14, 15, 15, 15, 15, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 21, 21, 21, 21, 22, 22, 22, 23, 23, 23 (list; graph; listen)

	OFFSET	`2,5`
	EXAMPLE	`a(2) = a(1) + a(0) = 1 = 1 + 0;` `a(3) = a(2) + a(0) = 1 = 1 + 0;` `a(4) = a(2) + a(1) = 2 = 1 + 1;` `a(5) = a(4) + a(0) = 2 = 2 + 0;` `a(6) = a(4) + a(1) = 3 = 2 + 1;` `a(7) = a(4) + a(2) = 3 = 2 + 1;` `a(8) = a(4) + a(3) = 3 = 2 + 1;` `a(9) = a(8) + a(0) = 3 = 3 + 0;`
	CROSSREFS	`Cf. A101403, A101404, A000045.` `Sequence in context: A103128 A107320 A095186 this_sequence A116458 A093875 A114214` `Adjacent sequences: A101399 A101400 A101401 this_sequence A101403 A101404 A101405`
	KEYWORD	`easy,nonn`
	AUTHOR	`Odimar Fabeny (aifab(AT)yahoo.com.br), Jan 16 2005`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research