Number of ways the first n squares can be partitioned into three sets with equal sums.
A327450
Number of ways the first n squares can be partitioned into three sets with 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) =0a(12) =1a(13) =0a(14) =0a(15) =0a(16) =137a(17) =211a(18) =0a(19) =0a(20) =0a(21) =3035a(22) =0a(23) =0a(24) =0a(25) =120465a(26) =259383a(27) =0a(28) =0a(29) =0
External references
- oeis: A327450