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.

A050065 a(n) = a(n-1) + a(m) for n >= 4, 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) = 1 and a(2) = a(3) = 3.

Table of values

n a(n)
1 1
2 3
3 3
4 6
5 7
6 13
7 16
8 19
9 20
10 39
11 55
12 68
13 75
14 81
15 84
16 87
17 88
18 175
19 259
20 340
21 415
22 483
23 538
24 577
25 597
26 616
27 632
28 645
29 652
30 658
31 661
32 664
33 665
34 1329
35 1990
36 2648
37 3300
38 3945
39 4577
40 5193
41 5790
42 6367
43 6905
44 7388
45 7803
46 8143
47 8402
48 8577

List of values

[1, 3, 3, 6, 7, 13, 16, 19, 20, 39, 55, 68, 75, 81, 84, 87, 88, 175, 259, 340, 415, 483, 538, 577, 597, 616, 632, 645, 652, 658, 661, 664, 665, 1329, 1990, 2648, 3300, 3945, 4577, 5193, 5790, 6367, 6905, 7388, 7803, 8143, 8402, 8577]