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.

A271063 a(1) = 2, a(2) = 3; thereafter a(n) = a(n-1) + a(|n-a(T)|), where a(T) is the largest term in the sequence before a(n) such that 0 < |n-a(T)| < n.

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 10
6 17
7 22
8 25
9 50
10 72
11 89
12 161
13 322
14 411
15 483
16 533
17 558
18 580
19 597
20 607
21 614
22 619
23 622
24 624
25 629
26 1253
27 1875
28 2494
29 3108
30 3715
31 4312
32 4892
33 5450
34 5983
35 6466
36 6877
37 13343
38 19326
39 24776
40 29668
41 33980
42 37695
43 40803
44 43297
45 86594
46 127397
47 165092
48 199072
49 228740
50 253516

List of values

[2, 3, 5, 7, 10, 17, 22, 25, 50, 72, 89, 161, 322, 411, 483, 533, 558, 580, 597, 607, 614, 619, 622, 624, 629, 1253, 1875, 2494, 3108, 3715, 4312, 4892, 5450, 5983, 6466, 6877, 13343, 19326, 24776, 29668, 33980, 37695, 40803, 43297, 86594, 127397, 165092, 199072, 228740, 253516]