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.

A050056 a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) 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) = 1.

Table of values

n a(n)
1 1
2 3
3 1
4 2
5 3
6 4
7 5
8 8
9 13
10 14
11 15
12 18
13 23
14 36
15 51
16 74
17 125
18 126
19 127
20 130
21 135
22 148
23 163
24 186
25 237
26 362
27 489
28 624
29 787
30 1024
31 1513
32 2300
33 3813
34 3814
35 3815
36 3818
37 3823
38 3836
39 3851
40 3874
41 3925
42 4050
43 4177
44 4312
45 4475
46 4712
47 5201

List of values

[1, 3, 1, 2, 3, 4, 5, 8, 13, 14, 15, 18, 23, 36, 51, 74, 125, 126, 127, 130, 135, 148, 163, 186, 237, 362, 489, 624, 787, 1024, 1513, 2300, 3813, 3814, 3815, 3818, 3823, 3836, 3851, 3874, 3925, 4050, 4177, 4312, 4475, 4712, 5201]