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.

A049893 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) = 1 and a(3) = 3.

Table of values

n a(n)
1 1
2 1
3 3
4 4
5 8
6 13
7 27
8 56
9 112
10 169
11 367
12 748
13 1501
14 3006
15 6013
16 12028
17 24056
18 36085
19 78185
20 159377
21 320259
22 641271
23 1282923
24 2566044
25 5132145
26 10264346
27 20528721
28 41057456
29 82114917
30 164229838
31 328459677
32 656919356
33 1313838712
34 1970758069
35 4269975817
36 8704181473

List of values

[1, 1, 3, 4, 8, 13, 27, 56, 112, 169, 367, 748, 1501, 3006, 6013, 12028, 24056, 36085, 78185, 159377, 320259, 641271, 1282923, 2566044, 5132145, 10264346, 20528721, 41057456, 82114917, 164229838, 328459677, 656919356, 1313838712, 1970758069, 4269975817, 8704181473]