110826888

Appears in sequences

• Number of solutions to 1 +- 2 +- 3 +- ... +- n = 0.at n=34A058377
• Number of ways of partitioning the set {1...n} into two subsets whose sums are as nearly equal as possible.at n=34A069918
• 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}.at n=8A104456
• Maximal coefficient of (1 + x^2) * (1 + x^3) * (1 + x^4) * ... * (1 + x^n).at n=35A369706