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.

A049913 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) = 4.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 11
6 18
7 37
8 76
9 153
10 231
11 501
12 1021
13 2049
14 4104
15 8209
16 16420
17 32841
18 49263
19 106737
20 217579
21 437213
22 875454
23 1751428
24 3503126
25 7006330
26 14012737
27 28025513
28 56051045
29 112102097
30 224204200
31 448408401
32 896816804
33 1793633609

List of values

[1, 2, 4, 5, 11, 18, 37, 76, 153, 231, 501, 1021, 2049, 4104, 8209, 16420, 32841, 49263, 106737, 217579, 437213, 875454, 1751428, 3503126, 7006330, 14012737, 28025513, 56051045, 112102097, 224204200, 448408401, 896816804, 1793633609]