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.

A233032 Numbers k such that the equation x + (sum of digits of x) = 10^k has two solutions.

Table of values

n a(n)
1 12
2 23
3 34
4 45
5 58
6 69
7 80
8 91
9 102
10 112
11 113
12 123
13 134
14 145
15 158
16 169
17 180
18 191
19 202
20 213
21 223
22 224
23 234
24 245
25 258
26 269
27 280
28 291
29 302
30 313
31 324
32 334
33 335
34 345
35 358
36 369
37 380
38 391
39 402
40 413
41 424
42 435
43 445
44 458
45 469
46 480
47 491
48 502
49 513
50 524
51 535
52 546
53 559
54 569
55 580
56 591
57 602
58 613
59 624
60 635
61 646
62 659
63 669
64 670
65 680
66 691
67 702

List of values

[12, 23, 34, 45, 58, 69, 80, 91, 102, 112, 113, 123, 134, 145, 158, 169, 180, 191, 202, 213, 223, 224, 234, 245, 258, 269, 280, 291, 302, 313, 324, 334, 335, 345, 358, 369, 380, 391, 402, 413, 424, 435, 445, 458, 469, 480, 491, 502, 513, 524, 535, 546, 559, 569, 580, 591, 602, 613, 624, 635, 646, 659, 669, 670, 680, 691, 702]