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.

A049909 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 smallest 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 4
5 9
6 15
7 31
8 63
9 127
10 192
11 416
12 848
13 1702
14 3409
15 6819
16 13639
17 27279
18 40920
19 88660
20 180730
21 363167
22 727188
23 1454808
24 2909840
25 5819745
26 11639554
27 23279140
28 46558296
29 93116598
30 186233201
31 372466403
32 744932807
33 1489865615

List of values

[1, 2, 3, 4, 9, 15, 31, 63, 127, 192, 416, 848, 1702, 3409, 6819, 13639, 27279, 40920, 88660, 180730, 363167, 727188, 1454808, 2909840, 5819745, 11639554, 23279140, 46558296, 93116598, 186233201, 372466403, 744932807, 1489865615]