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

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

%I #8 Apr 03 2017 10:05:45

%S 1,1,5,7,20,31,75,118,266,401,841,1345,2581,4023,7758,11932,21543,

%T 33941,59099,91816,159059,242955,407523,634827,1032202,1576276,

%U 2572429,3888631,6177754,9400070,14665453,22055721,34349618,51033150,78166821,116800290,176090572

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

%H Alois P. Heinz, <a href="/A258282/b258282.txt">Table of n, a(n) for n = 7..100</a>

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

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

%Y Column k=4 of A258280.

%K nonn

%O 7,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.

Last modified July 15 06:17 EDT 2024. Contains 374324 sequences. (Running on oeis4.)