The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258283 Number of partitions of 5 copies of n into distinct parts. 2
 1, 1, 6, 8, 29, 47, 134, 213, 559, 939, 2178, 3564, 8184, 13225, 27904, 46376, 93151, 153022, 302948, 489271, 931845, 1540667, 2818014, 4565768, 8369128, 13423638, 23782711, 38552461, 66714197, 106889113, 184313769, 291358130, 491972639, 785299762, 1298230358 (list; graph; refs; listen; history; text; internal format)
 OFFSET 9,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 9..50 FORMULA a(n) = 1/5! * [(x*y*z*u*v)^n] Product_{j>0} (1+x^j+y^j+z^j+u^j+v^j). EXAMPLE a(11) = 6: [11;10,1;9,2;8,3;7,4], [11;10,1;9,2;8,3;6,5], [11;10,1;9,2;7,4;6,5], [11;10,1;8,3;7,4;6,5], [11;9,2;8,3;7,4;6,5], [10,1;9,2;8,3;7,4;6,5]. CROSSREFS Column k=5 of A258280. Sequence in context: A007829 A345003 A000773 * A039720 A056097 A099431 Adjacent sequences: A258280 A258281 A258282 * A258284 A258285 A258286 KEYWORD nonn AUTHOR Alois P. Heinz, May 25 2015 STATUS approved

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

Last modified July 17 05:50 EDT 2024. Contains 374360 sequences. (Running on oeis4.)