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.

A049885 a(n) = a(1) + a(2) + ... + 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) = a(2) = a(3) = 1.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 4
6 7
7 15
8 30
9 60
10 91
11 197
12 402
13 807
14 1616
15 3233
16 6466
17 12932
18 19399
19 42031
20 85679
21 172167
22 344739
23 689683
24 1379472
25 2758975
26 5517980
27 11035975
28 22071958
29 44143919
30 88287840
31 176575681
32 353151362
33 706302724
34 1059454087

List of values

[1, 1, 1, 2, 4, 7, 15, 30, 60, 91, 197, 402, 807, 1616, 3233, 6466, 12932, 19399, 42031, 85679, 172167, 344739, 689683, 1379472, 2758975, 5517980, 11035975, 22071958, 44143919, 88287840, 176575681, 353151362, 706302724, 1059454087]