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.

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

Table of values

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

List of values

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