a(n) = smallest k >= 1 such that {1^n, 2^n, 3^n, ..., k^n} can be partitioned into two sets with equal sum.
A019568
a(n) = smallest k >= 1 such that {1^n, 2^n, 3^n, ..., k^n} can be partitioned into two sets with equal sum.
Terms
- a(0) =2a(1) =3a(2) =7a(3) =12a(4) =16a(5) =24a(6) =31a(7) =39a(8) =47a(9) =44a(10) =60a(11) =71a(12) =79a(13) =79a(14) =87
External references
- oeis: A019568