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.

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

Table of values

n a(n)
1 1
2 1
3 3
4 4
5 8
6 9
7 13
8 22
9 44
10 45
11 49
12 58
13 80
14 125
15 183
16 308
17 616
18 617
19 621
20 630
21 652
22 697
23 755
24 880
25 1188
26 1805
27 2435
28 3132
29 4012
30 5817
31 8949
32 14766
33 29532
34 29533
35 29537
36 29546
37 29568
38 29613
39 29671
40 29796
41 30104
42 30721
43 31351

List of values

[1, 1, 3, 4, 8, 9, 13, 22, 44, 45, 49, 58, 80, 125, 183, 308, 616, 617, 621, 630, 652, 697, 755, 880, 1188, 1805, 2435, 3132, 4012, 5817, 8949, 14766, 29532, 29533, 29537, 29546, 29568, 29613, 29671, 29796, 30104, 30721, 31351]