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.

A230643 Number of integers m such that m + (sum of digits in base-3 representation of m) = 2n.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 2
5 2
6 2
7 2
8 1
9 2
10 2
11 2
12 2
13 1
14 3
15 2
16 3
17 1
18 2
19 2
20 2
21 2
22 1
23 2
24 2
25 2
26 2
27 1
28 3
29 2
30 3
31 1
32 2
33 2
34 2
35 2
36 1
37 2
38 2
39 2
40 2
41 2
42 3
43 3
44 2
45 2
46 2
47 2
48 2
49 1
50 2
51 2
52 2
53 2
54 1
55 3
56 2
57 3
58 1
59 2
60 2
61 2
62 2
63 1
64 2
65 2
66 2
67 2
68 1
69 3
70 2
71 3
72 1
73 2
74 2
75 2
76 2
77 1
78 2
79 2
80 2
81 2
82 2
83 3
84 3
85 2
86 2
87 2
88 2
89 2
90 1
91 2
92 2
93 2
94 2
95 1
96 3
97 2
98 3
99 1
100 2
101 2
102 2

List of values

[1, 1, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2]