Define d(n,k) to be the number of '1' digits required to write out all the integers from 1 through k in base n. E.g., d(10,9) = 1 (just '1'), d(10,10) = 2 ('1' and '10'), d(10,11) = 4 ('1', '10' and '11'). Then a(n) is the first k >= 1 such that d(n,k) > k.
A092175
Define d(n,k) to be the number of '1' digits required to write out all the integers from 1 through k in base n. E.g., d(10,9) = 1 (just '1'), d(10,10) = 2 ('1' and '10'), d(10,11) = 4 ('1', '10' and '11'). Then a(n) is the first k >= 1 such that d(n,k) > k.
Terms
- a(0) =2a(1) =3a(2) =13a(3) =29a(4) =182a(5) =427a(6) =3931a(7) =8185a(8) =102781a(9) =199991a(10) =3179143a(11) =5971957a(12) =114818731a(13) =210826995a(14) =4754446861a(15) =8589934577a(16) =222195898594a(17) =396718580719
External references
- oeis: A092175