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.

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

Table of values

n a(n)
1 1
2 3
3 2
4 5
5 6
6 11
7 13
8 16
9 17
10 33
11 46
12 57
13 63
14 68
15 70
16 73
17 74
18 147
19 217
20 285
21 348
22 405
23 451
24 484
25 501
26 517
27 530
28 541
29 547
30 552
31 554
32 557
33 558
34 1115
35 1669
36 2221
37 2768
38 3309
39 3839
40 4356
41 4857
42 5341
43 5792
44 6197
45 6545
46 6830
47 7047
48 7194

List of values

[1, 3, 2, 5, 6, 11, 13, 16, 17, 33, 46, 57, 63, 68, 70, 73, 74, 147, 217, 285, 348, 405, 451, 484, 501, 517, 530, 541, 547, 552, 554, 557, 558, 1115, 1669, 2221, 2768, 3309, 3839, 4356, 4857, 5341, 5792, 6197, 6545, 6830, 7047, 7194]