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.

A050037 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) = a(2) = 1 and a(3) = 4.

Table of values

n a(n)
1 1
2 1
3 4
4 5
5 6
6 11
7 15
8 16
9 17
10 33
11 48
12 59
13 65
14 70
15 74
16 75
17 76
18 151
19 225
20 295
21 360
22 419
23 467
24 500
25 517
26 533
27 548
28 559
29 565
30 570
31 574
32 575
33 576
34 1151
35 1725
36 2295
37 2860
38 3419
39 3967
40 4500
41 5017
42 5517
43 5984
44 6403
45 6763
46 7058
47 7283
48 7434

List of values

[1, 1, 4, 5, 6, 11, 15, 16, 17, 33, 48, 59, 65, 70, 74, 75, 76, 151, 225, 295, 360, 419, 467, 500, 517, 533, 548, 559, 565, 570, 574, 575, 576, 1151, 1725, 2295, 2860, 3419, 3967, 4500, 5017, 5517, 5984, 6403, 6763, 7058, 7283, 7434]