cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 2
2 3
3 13
4 29
5 182
6 427
7 3931
8 8185
9 102781
10 199991
11 3179143
12 5971957
13 114818731
14 210826995
15 4754446861
16 8589934577
17 222195898594
18 396718580719
19 11575488191148
20 20479999999981
21 665306762187614
22 1168636602822635
23 41826814261329723
24 73040694872113129

List of values

[2, 3, 13, 29, 182, 427, 3931, 8185, 102781, 199991, 3179143, 5971957, 114818731, 210826995, 4754446861, 8589934577, 222195898594, 396718580719, 11575488191148, 20479999999981, 665306762187614, 1168636602822635, 41826814261329723, 73040694872113129]