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.

A334535 a(1) = 1, a(2) = 2, and for n > 2, a(n) = 2*a(a(n-i))+a(n-1)-a(n-2) where i >= 2 is the smallest number that satisfies a(n-i) < n.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 8
6 19
7 27
8 24
9 45
10 69
11 72
12 51
13 27
14 24
15 45
16 69
17 72
18 51
19 27
20 30
21 57
22 81
23 78
24 51
25 75
26 126
27 153
28 333
29 486
30 459
31 891
32 1350
33 1377
34 945
35 486
36 459
37 891
38 1350
39 1377
40 945
41 486
42 459
43 891
44 1350
45 1377
46 945
47 486
48 459
49 891
50 1350
51 1377
52 2781
53 4158
54 4131
55 2727
56 1350

List of values

[1, 2, 3, 5, 8, 19, 27, 24, 45, 69, 72, 51, 27, 24, 45, 69, 72, 51, 27, 30, 57, 81, 78, 51, 75, 126, 153, 333, 486, 459, 891, 1350, 1377, 945, 486, 459, 891, 1350, 1377, 945, 486, 459, 891, 1350, 1377, 945, 486, 459, 891, 1350, 1377, 2781, 4158, 4131, 2727, 1350]