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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A303947 Number of partitions of n into at most 1 copy of 2^2, 2 copies of 3^2, 3 copies of 4^2, ... . 3
 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 0, 0, 2, 0, 0, 1, 0, 2, 0, 2, 0, 2, 0, 1, 2, 0, 1, 0, 3, 0, 1, 1, 2, 3, 0, 2, 1, 4, 0, 1, 2, 2, 2, 0, 4, 1, 2, 1, 3, 3, 1, 3, 1, 5, 1, 3, 2, 4, 3, 1, 4, 2, 4, 1, 5, 3, 3, 4, 4, 6, 2, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,26 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..1000 FORMULA G.f.: Product_{k>=2} (1-x^(k^3))/(1-x^(k^2)). CROSSREFS Cf. A033461, A087153, A303942. Sequence in context: A269243 A036274 A047753 * A031123 A104194 A292261 Adjacent sequences:  A303944 A303945 A303946 * A303948 A303949 A303950 KEYWORD nonn,look AUTHOR Seiichi Manyama, May 03 2018 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 October 1 13:04 EDT 2020. Contains 337443 sequences. (Running on oeis4.)