The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A196889 Number of partitions of 2^n into powers of n. 2
 1, 1, 4, 3, 6, 9, 16, 36, 85, 210, 586, 1914, 6930, 28178, 125440, 603350, 3083410, 17362239, 112403052, 820563290, 6632950912, 58209665965, 544071039000, 5353538904357, 58523908575096, 730174875609318, 10274727352967428, 159586345364505768 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..150 FORMULA a(n) = [x^(2^n)] 1/Product_{j>=0}(1-x^(n^j)). EXAMPLE a(3) = 3 because there are 3 partitions of 2^3=8 into powers of 3: [1,1,3,3], [1,1,1,1,1,3], [1,1,1,1,1,1,1,1]. CROSSREFS Row n=2 of A196879. Sequence in context: A016702 A198610 A128754 * A005522 A276202 A215336 Adjacent sequences:  A196886 A196887 A196888 * A196890 A196891 A196892 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 07 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 06:09 EST 2021. Contains 349567 sequences. (Running on oeis4.)