a(n) is the number of ways the set {1^3, 2^3, ..., n^3} can be partitioned into two sets of equal sums.
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.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =0a(9) =0a(10) =0a(11) =1a(12) =0a(13) =0a(14) =2a(15) =1a(16) =0a(17) =0a(18) =2a(19) =62a(20) =0a(21) =0a(22) =268a(23) =356a(24) =0a(25) =0a(26) =2287a(27) =1130a(28) =0a(29) =0
External references
- oeis: A113263