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.
1, 3, 10, 52
Offset: 1
Examples
a(1) = 1 is trivial since binary operations *,+,-,/ are not applicable. a(2) = 3 since we can make 1,2,3 but not 4, using the number set {1,2}. a(3) = 10 since we can make 1,...,10 but not 11, using the number set {1,2,4}. a(4) = 52 since we can make 1,...,52 but not 53, using the number set {2,3,4,22}. a(5) >= 351 since we can make first 351 numbers using the number set {2,3,6,12,37}.
Links
- Math StackExchange, Largest consecutive integer using basic operations and optimal digits?
Comments