|
|
A185062
|
|
Number of n-element subsets that can be chosen from {1,2,...,2*n^3} having element sum n^4.
|
|
1
|
|
|
1, 1, 7, 351, 56217, 18878418, 11163952389, 10292468330630, 13703363417260677, 24932632800863823135, 59509756600504616529186, 180533923700628895521591343, 678854993880375551144618682344, 3100113915888360851262910882014885
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(n) is the number of partitions of n^4 into n distinct parts <= 2*n^3.
|
|
LINKS
|
|
|
EXAMPLE
|
a(0) = 1: {}.
a(1) = 1: {1}.
a(2) = 7: {1,15}, {2,14}, {3,13}, {4,12}, {5,11}, {6,10}, {7,9}.
|
|
MAPLE
|
b:= proc(n, i, t) option remember;
`if`(i<t or n<t*(t+1)/2 or n>t*(2*i-t+1)/2, 0,
`if`(n=0, 1, b(n, i-1, t) +`if`(n<i, 0, b(n-i, i-1, t-1))))
end:
a:= n-> b(n^4, 2*n^3, n):
seq(a(n), n=0..5);
|
|
MATHEMATICA
|
$RecursionLimit = 10000;
b[n_, i_, t_] := b[n, i, t] =
If[i < t || n < t(t+1)/2 || n > t(2i - t + 1)/2, 0,
If[n == 0, 1, b[n, i-1, t] + If[n < i, 0, b[n-i, i-1, t-1]]]];
a[n_] := b[n^4, 2 n^3, n];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|