id:A072376 - OEIS Search Results

Search: id:A072376

Displaying 1-1 of 1 results found.

page 1

a(n) = a([n/2]) + a([n/4]) + a([n/8]) + ... starting with a(0)=0 and a(1)=1.

+0
16

0, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32 (list; graph; listen)

	OFFSET	`0,5`
	FORMULA	`For n>1: a(n) =msb(n)/2 =2^[log2(n)-1] =2a([n/2]).` `G.f.: 1/(2-2x) (2x-x^2 + Sum_{k>=1} 2^(k-1)*x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Apr 18 2003`
	CROSSREFS	`Cf. A011782, A022825, A053644, A062383.` `Sequence in context: A006643 A080217 A157901 this_sequence A131883 A113452 A122461` `Adjacent sequences: A072373 A072374 A072375 this_sequence A072377 A072378 A072379`
	KEYWORD	`easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jul 19 2002`

page 1

Search completed in 0.002 seconds

Last modified November 22 20:51 EST 2009. Contains 167312 sequences.

AT&T Labs Research