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!)
A204464 Number of 2*n-element subsets that can be chosen from {1,2,...,16*n} having element sum n*(16*n+1). 1
1, 8, 790, 148718, 35154340, 9408671330, 2725410001024, 834014033203632, 265724127467961324, 87318355216835049968, 29402690636348418710858, 10098693807141197229592054, 3525753285145412581617963136, 1248001014165722671454730108968, 446964111600452023289482445527716 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
a(n) is the number of partitions of n*(16*n+1) into 2*n distinct parts <=16*n.
LINKS
EXAMPLE
a(1) = 8 because there are 8 2-element subsets that can be chosen from {1,2,...,16} having element sum 17: {1,16}, {2,15}, {3,14}, {4,13}, {5,12}, {6,11}, {7,10}, {8,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*(16*n+1), 16*n, 2*n):
seq(a(n), n=0..10);
MATHEMATICA
b[n_, i_, t_] /; i<t || n<t(t+1)/2 || n>t(2i-t+1)/2 = 0; b[0, _, _] = 1;
b[n_, i_, t_] := b[n, i, t] = b[n, i-1, t] + If[n<i, 0, b[n-i, i-1, t-1]];
a[n_] := b[n(16n+1), 16n, 2n];
a /@ Range[0, 10] (* Jean-François Alcover, Dec 07 2020, after Alois P. Heinz *)
CROSSREFS
Bisection of row n=8 of A204459.
Sequence in context: A145415 A260032 A332178 * A001547 A168310 A220186
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jan 18 2012
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 04:13 EDT 2024. Contains 371235 sequences. (Running on oeis4.)