A288350 Lexically smallest string of n digits from 1...9, such that no formula using the single digits in the given order exists that evaluates to 0.
1, 12, 124, 1251, 12721, 169896, 8985898
Offset: 1
Examples
a(3)=124: For all numbers starting with 11.. the formula can be chosen as (1-1)*.., 121: 1-2+1=0, 122: (1-2/2)=0, 123: 1+2-3=0, 124: 0 cannot by obtained by any valid formula.
Links
- IBM Research, Ponder This Challenge - June 2017, related problem for 7-digit numbers.
Comments