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.

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

Table of values

n a(n)
1 1
2 3
3 1
4 6
5 12
6 24
7 48
8 107
9 250
10 453
11 906
12 1823
13 3682
14 7566
15 15788
16 34352
17 80810
18 145833
19 291666
20 583343
21 1166722
22 2333646
23 4667948
24 9338672
25 18689450
26 37443922
27 75098700
28 151072456
29 305646138
30 625313778
31 1307036806
32 2844621050
33 6690632768
34 12074228731
35 24148457462
36 48296914935
37 96593829906

List of values

[1, 3, 1, 6, 12, 24, 48, 107, 250, 453, 906, 1823, 3682, 7566, 15788, 34352, 80810, 145833, 291666, 583343, 1166722, 2333646, 4667948, 9338672, 18689450, 37443922, 75098700, 151072456, 305646138, 625313778, 1307036806, 2844621050, 6690632768, 12074228731, 24148457462, 48296914935, 96593829906]