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!)
A258284 Number of partitions of 6 copies of n into distinct parts. 2

%I #12 Apr 13 2017 12:09:52

%S 1,1,7,10,40,64,215,373,1076,1823,5052,8519,21279,36836,86354,148550,

%T 338354,571638,1242227,2156661,4453444,7573979,15612927,26325001,

%U 52042210,88853970,170752721,288367364,550431942,916369374,1706148831,2877961566,5219075925

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

%H Alois P. Heinz, <a href="/A258284/b258284.txt">Table of n, a(n) for n = 11..50</a>

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

%e a(13) = 7: [13;12,1;11,2;10,3;9,4;8,5], [13;12,1;11,2;10,3;9,4;7,6], [13;12,1;11,2;10,3;8,5;7,6], [13;12,1;11,2;9,4;8,5;7,6], [13;12,1;10,3;9,4;8,5;7,6], [13;11,2;10,3;9,4;8,5;7,6], [12,1;11,2;10,3;9,4;8,5;7,6].

%Y Column k=6 of A258280.

%K nonn

%O 11,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 April 20 10:02 EDT 2024. Contains 371807 sequences. (Running on oeis4.)