A118771
Let a “sum” be a set {x,y,z} of distinct natural numbers such that x+y=z and let N_m={1,2,…m}. a(n) is the smallest s such that there is no partition of N_s into n sum-free parts.
offset: 1
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”- A118771computable