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.

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

Table of values

n a(n)
1 1
2 3
3 2
4 3
5 8
6 14
7 29
8 57
9 116
10 176
11 380
12 775
13 1556
14 3117
15 6235
16 12469
17 24940
18 37412
19 81058
20 165234
21 332029
22 664839
23 1330073
24 2660350
25 5320760
26 10641579
27 21283186
28 42566387
29 85132780
30 170265565
31 340531131
32 681062261
33 1362124524

List of values

[1, 3, 2, 3, 8, 14, 29, 57, 116, 176, 380, 775, 1556, 3117, 6235, 12469, 24940, 37412, 81058, 165234, 332029, 664839, 1330073, 2660350, 5320760, 10641579, 21283186, 42566387, 85132780, 170265565, 340531131, 681062261, 1362124524]