login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029930 If 2n = Sum 2^e_i, a(n) = Product 2^e_i. 2
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; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

14 = 8+4+2 so a(7) = 8*4*2 = 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: A076735 A192097 A132720 * A193850 A140119 A193846

Adjacent sequences:  A029927 A029928 A029929 * 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).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 10:43 EST 2012. Contains 205614 sequences.