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.

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

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 11
7 14
8 16
9 17
10 33
11 47
12 58
13 64
14 69
15 72
16 74
17 75
18 149
19 221
20 290
21 354
22 412
23 459
24 492
25 509
26 525
27 539
28 550
29 556
30 561
31 564
32 566
33 567
34 1133
35 1697
36 2258
37 2814
38 3364
39 3903
40 4428
41 4937
42 5429
43 5888
44 6300
45 6654
46 6944
47 7165
48 7314

List of values

[1, 2, 3, 5, 6, 11, 14, 16, 17, 33, 47, 58, 64, 69, 72, 74, 75, 149, 221, 290, 354, 412, 459, 492, 509, 525, 539, 550, 556, 561, 564, 566, 567, 1133, 1697, 2258, 2814, 3364, 3903, 4428, 4937, 5429, 5888, 6300, 6654, 6944, 7165, 7314]