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.

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

Table of values

n a(n)
1 1
2 3
3 2
4 7
5 16
6 30
7 62
8 123
9 251
10 496
11 994
12 1987
13 3979
14 7967
15 15948
16 31928
17 63917
18 127712
19 255426
20 510851
21 1021707
22 2043423
23 4086860
24 8173752
25 16347565
26 32695258
27 65390761
28 130782020
29 261565033
30 523132058
31 1046268104
32 2092544189

List of values

[1, 3, 2, 7, 16, 30, 62, 123, 251, 496, 994, 1987, 3979, 7967, 15948, 31928, 63917, 127712, 255426, 510851, 1021707, 2043423, 4086860, 8173752, 16347565, 32695258, 65390761, 130782020, 261565033, 523132058, 1046268104, 2092544189]