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.

A049933 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 4
5 8
6 19
7 35
8 70
9 140
10 349
11 663
12 1310
13 2609
14 5214
15 10425
16 20850
17 41700
18 104249
19 198073
20 390935
21 779265
22 1557231
23 3113815
24 6227316
25 12454423
26 24908776
27 49817517
28 99635018
29 199270025
30 398540046
31 797080089
32 1594160178
33 3188320356
34 7970800889
35 15144521689

List of values

[1, 1, 1, 4, 8, 19, 35, 70, 140, 349, 663, 1310, 2609, 5214, 10425, 20850, 41700, 104249, 198073, 390935, 779265, 1557231, 3113815, 6227316, 12454423, 24908776, 49817517, 99635018, 199270025, 398540046, 797080089, 1594160178, 3188320356, 7970800889, 15144521689]