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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091889 Number of partitions of n into sums of exactly two distinct powers of 2. 4
0, 0, 1, 0, 1, 2, 0, 1, 3, 2, 2, 5, 2, 3, 8, 4, 6, 12, 6, 11, 16, 11, 16, 24, 17, 23, 34, 26, 35, 50, 35, 50, 67, 55, 72, 93, 76, 99, 126, 112, 135, 171, 150, 186, 229, 210, 249, 304, 280, 336, 398, 380, 443, 526, 499, 584, 680, 665, 759, 886, 858, 985, 1136, 1123 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

EXAMPLE

a(9)=3: 9 = (2^3+2^0) = (2^2+2^1)+(2^1+2^0) =

(2^1+2^0)+(2^1+2^0)+(2^1+2^0).

CROSSREFS

Cf. A018819, A091890, A000120, A000041, A091893, A091891.

Sequence in context: A144190 A177802 A022827 * A147785 A067591 A097609

Adjacent sequences:  A091886 A091887 A091888 * A091890 A091891 A091892

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 10 2004

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 16 21:42 EST 2012. Contains 205977 sequences.