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.

A049940 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1) with a(1) = a(2) = 1.

Table of values

n a(n)
1 1
2 1
3 3
4 6
5 14
6 26
7 54
8 119
9 278
10 503
11 1008
12 2027
13 4094
14 8412
15 17554
16 38194
17 89848
18 162143
19 324288
20 648587
21 1297214
22 2594652
23 5190034
24 10383154
25 20779768
26 41631830
27 83498100
28 167969126
29 339831072
30 695251878
31 1453222088
32 3162777148
33 7438945312
34 13424668537
35 26849337076
36 53698674163

List of values

[1, 1, 3, 6, 14, 26, 54, 119, 278, 503, 1008, 2027, 4094, 8412, 17554, 38194, 89848, 162143, 324288, 648587, 1297214, 2594652, 5190034, 10383154, 20779768, 41631830, 83498100, 167969126, 339831072, 695251878, 1453222088, 3162777148, 7438945312, 13424668537, 26849337076, 53698674163]