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.

A050031 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) = 2.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 6
6 7
7 10
8 17
9 34
10 35
11 38
12 45
13 62
14 97
15 142
16 239
17 478
18 479
19 482
20 489
21 506
22 541
23 586
24 683
25 922
26 1401
27 1890
28 2431
29 3114
30 4515
31 6946
32 11461
33 22922
34 22923
35 22926
36 22933
37 22950
38 22985
39 23030
40 23127
41 23366
42 23845
43 24334

List of values

[1, 1, 2, 3, 6, 7, 10, 17, 34, 35, 38, 45, 62, 97, 142, 239, 478, 479, 482, 489, 506, 541, 586, 683, 922, 1401, 1890, 2431, 3114, 4515, 6946, 11461, 22922, 22923, 22926, 22933, 22950, 22985, 23030, 23127, 23366, 23845, 24334]