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.

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

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 7
6 12
7 25
8 50
9 101
10 153
11 331
12 675
13 1355
14 2714
15 5429
16 10858
17 21717
18 32577
19 70583
20 143881
21 289121
22 578922
23 1158188
24 2316554
25 4633160
26 9266371
27 18532767
28 37065547
29 74131099
30 148262202
31 296524405
32 593048810
33 1186097621

List of values

[1, 2, 2, 3, 7, 12, 25, 50, 101, 153, 331, 675, 1355, 2714, 5429, 10858, 21717, 32577, 70583, 143881, 289121, 578922, 1158188, 2316554, 4633160, 9266371, 18532767, 37065547, 74131099, 148262202, 296524405, 593048810, 1186097621]