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.

A230853 Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly one solution.

Table of values

n a(n)
1 0
2 2
3 6
4 16
5 26
6 34
7 44
8 54
9 62
10 72
11 98
12 108
13 116
14 126
15 136
16 144
17 154
18 180
19 190
20 198
21 208
22 218
23 226
24 236
25 260
26 270
27 278
28 288
29 298
30 306
31 316
32 342
33 352
34 360
35 370
36 380
37 388
38 398
39 424
40 434
41 442
42 452
43 462
44 470
45 480
46 504
47 514
48 522
49 532
50 542
51 550
52 560
53 586
54 596
55 604
56 614
57 624
58 632
59 642
60 668
61 678
62 686

List of values

[0, 2, 6, 16, 26, 34, 44, 54, 62, 72, 98, 108, 116, 126, 136, 144, 154, 180, 190, 198, 208, 218, 226, 236, 260, 270, 278, 288, 298, 306, 316, 342, 352, 360, 370, 380, 388, 398, 424, 434, 442, 452, 462, 470, 480, 504, 514, 522, 532, 542, 550, 560, 586, 596, 604, 614, 624, 632, 642, 668, 678, 686]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.