A292550
a(n) = smallest k >= 1 such that {1, 3^n, 5^n, … , (4*k-1)^n} can be partitioned into two sets with equal sums.
offset: 0
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A292550computable