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.

A050047 a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 8
6 10
7 14
8 24
9 48
10 50
11 54
12 64
13 88
14 138
15 202
16 340
17 680
18 682
19 686
20 696
21 720
22 770
23 834
24 972
25 1312
26 1994
27 2690
28 3460
29 4432
30 6426
31 9886
32 16312
33 32624
34 32626
35 32630
36 32640
37 32664
38 32714
39 32778
40 32916
41 33256
42 33938
43 34634

List of values

[1, 2, 2, 4, 8, 10, 14, 24, 48, 50, 54, 64, 88, 138, 202, 340, 680, 682, 686, 696, 720, 770, 834, 972, 1312, 1994, 2690, 3460, 4432, 6426, 9886, 16312, 32624, 32626, 32630, 32640, 32664, 32714, 32778, 32916, 33256, 33938, 34634]