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.

A329474 a(n) = log_2(A110428(n)). Also, a(n) = a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 0 and a(2) = 1.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 2
6 4
7 5
8 6
9 6
10 12
11 17
12 21
13 23
14 25
15 26
16 27
17 27
18 54
19 80
20 105
21 128
22 149
23 166
24 178
25 184
26 190
27 195
28 199
29 201
30 203
31 204
32 205
33 205
34 410
35 614
36 817
37 1018
38 1217
39 1412
40 1602
41 1786
42 1964
43 2130
44 2279
45 2407
46 2512
47 2592
48 2646
49 2673
50 2700
51 2726
52 2751
53 2774
54 2795
55 2812
56 2824
57 2830

List of values

[0, 1, 1, 2, 2, 4, 5, 6, 6, 12, 17, 21, 23, 25, 26, 27, 27, 54, 80, 105, 128, 149, 166, 178, 184, 190, 195, 199, 201, 203, 204, 205, 205, 410, 614, 817, 1018, 1217, 1412, 1602, 1786, 1964, 2130, 2279, 2407, 2512, 2592, 2646, 2673, 2700, 2726, 2751, 2774, 2795, 2812, 2824, 2830]