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.

A103318 Number of solutions i in range [0,n-1] to i == 0 mod 2^(n-i).

Table of values

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

List of values

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