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.

A049945 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) = 1 and a(3) = 4.

Table of values

n a(n)
1 1
2 1
3 4
4 7
5 14
6 34
7 65
8 127
9 254
10 634
11 1206
12 2381
13 4742
14 9477
15 18951
16 37899
17 75798
18 189494
19 360040
20 710606
21 1416477
22 2830593
23 5660011
24 11319450
25 22638520
26 45276913
27 90553764
28 181107497
29 362214974
30 724429941
31 1448859879
32 2897719755
33 5795439510
34 14488598774
35 27528337672
36 54332245406

List of values

[1, 1, 4, 7, 14, 34, 65, 127, 254, 634, 1206, 2381, 4742, 9477, 18951, 37899, 75798, 189494, 360040, 710606, 1416477, 2830593, 5660011, 11319450, 22638520, 45276913, 90553764, 181107497, 362214974, 724429941, 1448859879, 2897719755, 5795439510, 14488598774, 27528337672, 54332245406]