A114925 "Walking base" sequence: the number becomes the least base in which it could be read, once; written in base 10.
0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 2, 5, 8, 11, 3, 6, 9, 12, 3, 7, 10, 4, 7, 11, 4, 8, 12, 4, 9, 13, 4, 10, 5, 9, 14, 5, 10, 6, 10, 7, 12, 5, 11, 5, 12, 6, 11, 6, 12, 7, 13, 5, 13, 6, 13, 7, 14, 6, 14, 7, 15, 6, 15, 7, 16, 7, 17, 8, 13, 8, 14, 8, 15, 8, 16, 8, 17, 9, 15
Offset: 0
Examples
Examples: The beginning is 0,2,3 but could also be 1,2,3. a(0)=0. Now the least base in which 0 has a meaning is the binary base, so next term, a(1)=2. The least base in which 2 makes sense is 3, so next term, a(2)=3. The least base in which "10" makes sense is not base 11 but base 2, so next term, a(10)=2 (although 2 was used to read 0, it has not yet been used to read "10"). The least base in which this second 2 makes sense now is not 3 (because 3 has already been used to read a(1)=2), but 4, so next term a(11)=4. a(101)=10: the least base not used so far to read "10" is base 10, so a(102)=10; then a(103)=11 (and although the value a(102)="10" in base 11 should be written "A", which is impossible in the OEIS, this does not affect the next term a(103); anyway, this walking base is written all along in base 10, so a(102)=10).
Comments