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.

A165419 Each a(n) is chosen so that n = sum a(k), for all n >= 0, where k is over the distinct nonnegative values of the substrings in binary n.

Table of values

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

List of values

[0, 1, 1, 2, 2, 3, 2, 4, 4, 5, 5, 4, 4, 4, 4, 8, 8, 9, 9, 8, 8, 11, 9, 8, 8, 8, 8, 10, 8, 8, 8, 16, 16, 17, 17, 16, 18, 16, 17, 16, 16, 16, 21, 16, 16, 19, 17, 16, 16, 16, 16, 18, 16, 16, 18, 16, 16, 16, 16, 16, 16, 16, 16, 32, 32, 33, 33, 32, 34, 32, 33, 32, 32, 37, 32, 32, 34, 32, 33]