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.

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

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 7
6 13
7 17
8 19
9 20
10 39
11 56
12 69
13 76
14 82
15 86
16 88
17 89
18 177
19 263
20 345
21 421
22 490
23 546
24 585
25 605
26 624
27 641
28 654
29 661
30 667
31 671
32 673
33 674
34 1347
35 2018
36 2685
37 3346
38 4000
39 4641
40 5265
41 5870
42 6455
43 7001
44 7491
45 7912
46 8257
47 8520
48 8697

List of values

[1, 2, 4, 6, 7, 13, 17, 19, 20, 39, 56, 69, 76, 82, 86, 88, 89, 177, 263, 345, 421, 490, 546, 585, 605, 624, 641, 654, 661, 667, 671, 673, 674, 1347, 2018, 2685, 3346, 4000, 4641, 5265, 5870, 6455, 7001, 7491, 7912, 8257, 8520, 8697]