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.

A050057 a(n) = 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 4
5 5
6 9
7 10
8 13
9 14
10 27
11 37
12 46
13 51
14 55
15 56
16 59
17 60
18 119
19 175
20 230
21 281
22 327
23 364
24 391
25 405
26 418
27 428
28 437
29 442
30 446
31 447
32 450
33 451
34 901
35 1348
36 1794
37 2236
38 2673
39 3101
40 3519
41 3924
42 4315
43 4679
44 5006
45 5287
46 5517
47 5692
48 5811

List of values

[1, 3, 1, 4, 5, 9, 10, 13, 14, 27, 37, 46, 51, 55, 56, 59, 60, 119, 175, 230, 281, 327, 364, 391, 405, 418, 428, 437, 442, 446, 447, 450, 451, 901, 1348, 1794, 2236, 2673, 3101, 3519, 3924, 4315, 4679, 5006, 5287, 5517, 5692, 5811]