References to A113263

a(n) is the number of ways the set {1^3, 2^3, ..., n^3} can be partitioned into two sets of equal sums.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 1, 0, 0, 2, 62, 0, 0, 268, 356, 0, 0, 2287, 1130, 0


1 seqfan posts

Sat May 2 16:12:32 CEST 2009    [seqfan] Re: OEIS duplicate hunt

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .