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.
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.
Terms
- a(0) =2a(1) =8a(2) =23a(3) =66
External references
- oeis: A072842