A330431 a(n) is the smallest k such that {1^2, 2^2, 3^2, ..., k^2} can be partitioned into n sets of equal sums.
1, 7, 13, 15, 19, 31, 27, 32, 53, 39, 43, 63, 52, 55
Offset: 1
Examples
For n = 1 the set is {1}
For n = 2 the sets are {1,2,4,7}, {3,5,6}.
For n = 3 the sets are {2,10,13}, {4,7,8,12}, {1,3,5,6,9,11}.
For n = 4 the sets are {2,9,15}, {1,7,8,14}, {4,5,10,13}, {3,6,11,12}.
For n = 5 the sets are {4,6,9,19}, {1,13,18}, {3,14,17}, {2,7,8,11,16}, {5,10,12,15}.
For n = 6 the sets are {1,3,6,27,31}, {4,12,26,30}, {5,7,14,25,29}, {2,8,20,22,28}, {9,13,15,18,19,24}, {10,11,16,17,21,23}.
Extensions
a(12) from Giovanni Resta, Jun 08 2020
a(13)-a(14) from Dean D. Ballard, Jun 12 2020