A309885
a(n) is the largest integer k such that there exists a set of n integers from which each number in 1,…,k can be built using the basic operations +,-,*,/, with parentheses allowed, and using each element of the set exactly once.
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”- A309885computable