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.

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

Table of values

n a(n)
1 0
2 2
3 4
4 5
5 6
6 7
7 9
8 10
9 11
10 12
11 14
12 15
13 16
14 22
15 23
16 24
17 26
18 27
19 28
20 29
21 31
22 32
23 33
24 39
25 40
26 41
27 43
28 44
29 45
30 46
31 48
32 49
33 50
34 56
35 57
36 58
37 60
38 61
39 62
40 63
41 66
42 68
43 69
44 71
45 74
46 75
47 76
48 77
49 79
50 80
51 81
52 87
53 88
54 89
55 91
56 92
57 93
58 94
59 96
60 97
61 98
62 104
63 105
64 106
65 108
66 109
67 110
68 111
69 113
70 114
71 115
72 121
73 122
74 123
75 125
76 126
77 127

List of values

[0, 2, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15, 16, 22, 23, 24, 26, 27, 28, 29, 31, 32, 33, 39, 40, 41, 43, 44, 45, 46, 48, 49, 50, 56, 57, 58, 60, 61, 62, 63, 66, 68, 69, 71, 74, 75, 76, 77, 79, 80, 81, 87, 88, 89, 91, 92, 93, 94, 96, 97, 98, 104, 105, 106, 108, 109, 110, 111, 113, 114, 115, 121, 122, 123, 125, 126, 127]