|
Search: id:A104456
|
|
|
| A104456 |
|
Number of ways of partitioning the integers {1,2,..,4n-1} into two (unordered) sets such that the sums of parts are equal in both sets (parts in one of the sets hence sum up to n*(4n-1)). Number of solutions to {1 +- 2 +- 3+ ... +- 4n-1 = 0}. |
|
+0
3
|
|
| 1, 4, 35, 361, 4110, 49910, 632602, 8273610, 110826888, 1512776590, 20965992017, 294245741167, 4173319332859, 59723919552183, 861331863890066, 12505857230438737, 182650875111521033, 2681644149792639400
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n) is half the coefficient of q^(n*(4n - 1)) in product('1 + x^j', 'j'=1..4*n-1) for n >= 1.
n>=1, a(n)=(1/Pi)*2^(4n-1)*J(4n-1) where J(n)=integral(t=0,Pi/2,cos(t)cos(2t)...cos(nt)dt) - Benoit Cloitre (abmt(AT)orange.fr), Sep 24 2006
|
|
EXAMPLE
|
a(2)=4 since there are 4 ways of partitioning {1,2,3,4,5,6,7} into two
sets of equal sum, namely {{1,2,5,6}, {3,4,7}}, {{1,3,4,6}, {2,5,7}},{{2,3,4,5}, {1,6,7}}, {{1,2,4,7}, {3,5,6}}.
|
|
MATHEMATICA
|
Table[CoefficientList[Product[1 + x^j, {j, 1, 4n - 1}], x][[n*(4n - 1) + 1]]/2, {n, 1, 20}]
|
|
CROSSREFS
|
Cf. A060005. a(n)=A058377(4n-1). Also a(n) = A123117(n)/2.
Sequence in context: A104526 A145607 A026304 this_sequence A123224 A132694 A143669
Adjacent sequences: A104453 A104454 A104455 this_sequence A104457 A104458 A104459
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Yiu Tung Poon (ytpoon(AT)iastate.edu) and Chun Chor Litwin Cheng (cccheng(AT)ied.edu.hk), Mar 08 2005
|
|
|
Search completed in 0.002 seconds
|
