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!)
 A303939 Number of partitions of n into at most 2 copies of 1, 3 copies of 2, 4 copies of 3, ... . 3
 1, 1, 2, 2, 4, 5, 8, 10, 14, 18, 25, 32, 43, 54, 71, 88, 114, 141, 180, 221, 278, 340, 423, 515, 634, 768, 938, 1131, 1372, 1646, 1985, 2371, 2844, 3383, 4037, 4783, 5682, 6709, 7936, 9339, 11004, 12908, 15155, 17724, 20740, 24186, 28214, 32812, 38165, 44271, 51354 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..10000 (first 1001 terms from Seiichi Manyama) FORMULA G.f.: Product_{k>=1} (1-x^(k*(k+2)))/(1-x^k). EXAMPLE a(5) = 5 because we have [5], [4,1], [3,2], [3,1,1] and [2,2,1]. CROSSREFS Column k=2 of A303940. Sequence in context: A053097 A331443 A035946 * A326446 A323530 A271593 Adjacent sequences:  A303936 A303937 A303938 * A303940 A303941 A303942 KEYWORD nonn 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 August 7 11:56 EDT 2020. Contains 336276 sequences. (Running on oeis4.)