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.

A230854 Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly two solutions.

Table of values

n a(n)
1 4
2 8
3 10
4 12
5 14
6 18
7 20
8 22
9 24
10 30
11 36
12 38
13 40
14 42
15 46
16 48
17 50
18 52
19 58
20 64
21 66
22 68
23 70
24 74
25 76
26 78
27 80
28 82
29 88
30 90
31 92
32 94
33 96
34 100
35 102
36 104
37 106
38 112
39 118
40 120
41 122
42 124
43 128
44 130
45 132
46 134
47 140
48 146
49 148
50 150
51 152
52 156
53 158
54 160
55 162
56 164
57 170
58 172
59 174
60 176
61 178
62 182
63 184
64 186
65 188

List of values

[4, 8, 10, 12, 14, 18, 20, 22, 24, 30, 36, 38, 40, 42, 46, 48, 50, 52, 58, 64, 66, 68, 70, 74, 76, 78, 80, 82, 88, 90, 92, 94, 96, 100, 102, 104, 106, 112, 118, 120, 122, 124, 128, 130, 132, 134, 140, 146, 148, 150, 152, 156, 158, 160, 162, 164, 170, 172, 174, 176, 178, 182, 184, 186, 188]

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

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