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.

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

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 5
6 11
7 21
8 43
9 84
10 170
11 339
12 679
13 1356
14 2710
15 5414
16 10818
17 21614
18 43270
19 86539
20 173079
21 346156
22 692310
23 1384614
24 2769218
25 5538414
26 11076787
27 22153488
28 44306807
29 88613274
30 177225871
31 354450388
32 708898072
33 1417790740

List of values

[1, 2, 1, 3, 5, 11, 21, 43, 84, 170, 339, 679, 1356, 2710, 5414, 10818, 21614, 43270, 86539, 173079, 346156, 692310, 1384614, 2769218, 5538414, 11076787, 22153488, 44306807, 88613274, 177225871, 354450388, 708898072, 1417790740]