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.

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

Table of values

n a(n)
1 17
2 19
3 21
4 34
5 36
6 38
7 51
8 53
9 55
10 65
11 67
12 70
13 72
14 82
15 84
16 86
17 99
18 101
19 103
20 116
21 118
22 120
23 130
24 132
25 135
26 137
27 147
28 149
29 151
30 164
31 166
32 168
33 181
34 183
35 185
36 195
37 197
38 200
39 202
40 212
41 214
42 216
43 229
44 231
45 233
46 246
47 248
48 250
49 257
50 261
51 262
52 263
53 267
54 274
55 276
56 278
57 291
58 293
59 295
60 308
61 310
62 312
63 322
64 324
65 327
66 329
67 339

List of values

[17, 19, 21, 34, 36, 38, 51, 53, 55, 65, 67, 70, 72, 82, 84, 86, 99, 101, 103, 116, 118, 120, 130, 132, 135, 137, 147, 149, 151, 164, 166, 168, 181, 183, 185, 195, 197, 200, 202, 212, 214, 216, 229, 231, 233, 246, 248, 250, 257, 261, 262, 263, 267, 274, 276, 278, 291, 293, 295, 308, 310, 312, 322, 324, 327, 329, 339]