id:A029930 - OEIS Search Results

Search: id:A029930

Displaying 1-1 of 1 results found.

page 1

If 2n = Sum 2^e_i, a(n) = Product 2^e_i.

+0
3

1, 2, 4, 8, 8, 16, 32, 64, 16, 32, 64, 128, 128, 256, 512, 1024, 32, 64, 128, 256, 256, 512, 1024, 2048, 512, 1024, 2048, 4096, 4096, 8192, 16384, 32768, 64, 128, 256, 512, 512, 1024, 2048, 4096, 1024, 2048, 4096, 8192, 8192, 16384, 32768, 65536, 2048 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`14 = 8+4+2 so a(7) = 842 = 64.` `G.f. prod(k>=0, 1+2^(k+1)x^2^k). a(0)=1, a(2n) = 2^e1(n)*a(n), a(2n+1) = 2a(2n), where e1(n) = A000120(n). a(n) = 2^A029931(n). - Ralf Stephan, Jun 19 2003`
	CROSSREFS	`Cf. A059867, A073642.` `Sequence in context: A073616 A076735 A132720 this_sequence A140119 A011402 A131625` `Adjacent sequences: A029927 A029928 A029929 this_sequence A029931 A029932 A029933`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from Erich Friedman (erich.friedman(AT)stetson.edu).`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research