A072842
Largest m such that we can partition the set {1,2,…,m} into n subsets with the property that we never have a+b=c for any distinct elements a, b, c in one subset.
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”- A072842computable