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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258283 Number of partitions of 5 copies of n into distinct parts. 2

%I #9 Apr 03 2017 10:04:46

%S 1,1,6,8,29,47,134,213,559,939,2178,3564,8184,13225,27904,46376,93151,

%T 153022,302948,489271,931845,1540667,2818014,4565768,8369128,13423638,

%U 23782711,38552461,66714197,106889113,184313769,291358130,491972639,785299762,1298230358

%N Number of partitions of 5 copies of n into distinct parts.

%H Alois P. Heinz, <a href="/A258283/b258283.txt">Table of n, a(n) for n = 9..50</a>

%F a(n) = 1/5! * [(x*y*z*u*v)^n] Product_{j>0} (1+x^j+y^j+z^j+u^j+v^j).

%e 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].

%Y Column k=5 of A258280.

%K nonn

%O 9,3

%A _Alois P. Heinz_, May 25 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 13 10:14 EDT 2024. Contains 375904 sequences. (Running on oeis4.)