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.

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

Table of values

n a(n)
1 1
2 2
3 3
4 8
5 15
6 37
7 69
8 137
9 273
10 682
11 1296
12 2560
13 5098
14 10189
15 20373
16 40745
17 81489
18 203722
19 387072
20 763960
21 1522829
22 3043120
23 6084976
24 12169338
25 24338267
26 48676398
27 97352728
28 194705424
29 389410826
30 778821645
31 1557643285
32 3115286569
33 6230573137
34 15576432842
35 29595222400

List of values

[1, 2, 3, 8, 15, 37, 69, 137, 273, 682, 1296, 2560, 5098, 10189, 20373, 40745, 81489, 203722, 387072, 763960, 1522829, 3043120, 6084976, 12169338, 24338267, 48676398, 97352728, 194705424, 389410826, 778821645, 1557643285, 3115286569, 6230573137, 15576432842, 29595222400]