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.

A050030 a(n) = a(n-1) + a(m) for n >= 3, 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) = a(2) = 1.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 4
6 5
7 6
8 8
9 11
10 12
11 13
12 15
13 18
14 22
15 27
16 33
17 41
18 42
19 43
20 45
21 48
22 52
23 57
24 63
25 71
26 82
27 94
28 107
29 122
30 140
31 162
32 189
33 222
34 223
35 224
36 226
37 229
38 233
39 238
40 244
41 252
42 263
43 275
44 288
45 303
46 321
47 343
48 370
49 403

List of values

[1, 1, 2, 3, 4, 5, 6, 8, 11, 12, 13, 15, 18, 22, 27, 33, 41, 42, 43, 45, 48, 52, 57, 63, 71, 82, 94, 107, 122, 140, 162, 189, 222, 223, 224, 226, 229, 233, 238, 244, 252, 263, 275, 288, 303, 321, 343, 370, 403]