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.

A151755 a(n) = 0 for n <= 4; for n >= 5, write n = 2^i + j, 0 <= j < 2^i; if j <= 2^i-2 then a(n) = 2*a(j) + a(j+1); if j = 2^i-1 then a(n) = 2*a(j) + a(j+1) + 1.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 3, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 5, 7, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 5, 6, 0, 0, 0, 0, 0, 1, 4, 4, 0, 0, 0, 0, 1, 7, 17, 15, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 5, 6, 0, 0, 0, 0, 0, 1, 4, 4, 0, 0, 0, 0, 1, 7, 17, 14, 0, 0, 0, 0, 0, 1, 4]