Number of ways the first n cubes can be partitioned into three sets with equal sums.
A327448
Number of ways the first n cubes can be partitioned into three sets with equal sums.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =691a(4) =3416a(5) =0a(6) =233a(7) =1168a(8) =0a(9) =8857a(10) =18157a(11) =0a(12) =2176512a(13) =3628118a(14) =0a(15) =3204865a(16) =8031495a(17) =0a(18) =79514209a(19) =205927212a(20) =0a(21) =5152732369a(22) =13493840291a(23) =0
External references
- oeis: A327448