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.

A384883 Number of maximal sparse subsets of the binary indices of n, where a set is sparse iff 1 is not a first difference.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 3, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 4, 2, 2, 3, 4, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 3, 2, 2, 2, 4, 2, 2, 4, 4, 2, 2, 2, 4, 3, 3, 4, 5, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 3, 1, 1, 1, 2, 1, 1, 2]