1199892

Appears in sequences

• Number of solutions to 1 +- 2 +- 3 +- ... +- n = 0.at n=27A058377
• Number of ways of partitioning the integers {1,2,..,4n} into two (unordered) sets such that the sums of parts are equal in both sets (parts in either set will add up to (4n)*(4n+1)/4). Number of solutions to {1 +- 2 +- 3 +- ... +- 4n=0}.at n=7A060005
• Number of ways of partitioning the set {1...n} into two subsets whose sums are as nearly equal as possible.at n=27A069918
• Erroneous version of A058377.at n=13A124624
• Maximal coefficient of (1 + x^2) * (1 + x^3) * (1 + x^4) * ... * (1 + x^n).at n=28A369706