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.

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

Table of values

n a(n)
1 1
2 3
3 1
4 2
5 6
6 11
7 23
8 44
9 90
10 137
11 295
12 602
13 1209
14 2422
15 4845
16 9688
17 19378
18 29069
19 62981
20 128385
21 257983
22 516573
23 1033453
24 2067064
25 4134175
26 8268396
27 16536813
28 33073638
29 66147281
30 132294566
31 264589133
32 529178264
33 1058356530

List of values

[1, 3, 1, 2, 6, 11, 23, 44, 90, 137, 295, 602, 1209, 2422, 4845, 9688, 19378, 29069, 62981, 128385, 257983, 516573, 1033453, 2067064, 4134175, 8268396, 16536813, 33073638, 66147281, 132294566, 264589133, 529178264, 1058356530]