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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131995 Number of partitions of n into powers of 2 or of 3. 5
1, 2, 3, 5, 6, 9, 11, 16, 20, 26, 32, 42, 50, 62, 74, 92, 108, 131, 153, 184, 213, 251, 288, 339, 387, 448, 511, 589, 666, 761, 857, 976, 1095, 1237, 1384, 1561, 1737, 1946, 2161, 2415, 2672, 2971, 3281, 3640, 4007, 4425, 4860, 5359, 5869, 6446, 7049, 7729, 8428 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

G.f.=(1-x)/Product((1-x^(2^k))(1-x^(3^k)), k=0..infinity) (offset 0). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 26 2007

EXAMPLE

a(10) = #{9+1, 8+2, 8+1+1, 4+4+2, 4+4+1+1, 4+3+3, 4+3+2+1,

4+3+1+1+1, 4+2+2+2, 4+2+2+1+1, 4+2+1+1+1+1, 4+1+1+1+1+1+1, 3+3+3+1,

3+3+2+2, 3+3+2+1+1, 3+3+1+1+1+1, 3+2+2+2+1, 3+2+2+1+1+1,

3+2+1+1+1+1+1, 3+1+1+1+1+1+1+1, 2+2+2+2+2, 2+2+2+2+1+1, 2+2+2+1+1+1+1,

2+2+1+1+1+1+1+1, 2+1+1+1+1+1+1+1+1, 1+1+1+1+1+1+1+1+1+1} = 26.

MAPLE

g:=(1-x)/(product((1-x^(2^k))*(1-x^(3^k)), k=0..10)): gser:=series(g, x=0, 60): seq(coeff(gser, x, n), n=1..53); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 26 2007

CROSSREFS

Cf. A018819, A062051, A023893, A000041, A131996.

Sequence in context: A008769 A115270 A027588 * A060714 A032718 A086191

Adjacent sequences:  A131992 A131993 A131994 * A131996 A131997 A131998

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 06 2007

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 11:17 EST 2012. Contains 205623 sequences.