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.

A049922 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 5
5 8
6 18
7 34
8 69
9 135
10 274
11 546
12 1093
13 2183
14 4363
15 8716
16 17416
17 34797
18 69662
19 139322
20 278645
21 557287
22 1114571
23 2229132
24 4458248
25 8916461
26 17832856
27 35665573
28 71330874
29 142661201
30 285321312
31 570640444
32 1141276535
33 2282544370

List of values

[1, 3, 2, 5, 8, 18, 34, 69, 135, 274, 546, 1093, 2183, 4363, 8716, 17416, 34797, 69662, 139322, 278645, 557287, 1114571, 2229132, 4458248, 8916461, 17832856, 35665573, 71330874, 142661201, 285321312, 570640444, 1141276535, 2282544370]