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.

A004978 a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 13
6 21
7 31
8 45
9 60
10 76
11 97
12 119
13 144
14 170
15 198
16 231
17 265
18 300
19 336
20 374
21 414
22 456
23 502
24 550
25 599
26 649
27 702
28 759
29 819
30 881
31 945
32 1010
33 1080
34 1157
35 1237
36 1318
37 1401
38 1486
39 1572
40 1662
41 1753
42 1845
43 1945
44 2049
45 2156
46 2264
47 2380
48 2499
49 2623
50 2750
51 2882

List of values

[1, 2, 4, 8, 13, 21, 31, 45, 60, 76, 97, 119, 144, 170, 198, 231, 265, 300, 336, 374, 414, 456, 502, 550, 599, 649, 702, 759, 819, 881, 945, 1010, 1080, 1157, 1237, 1318, 1401, 1486, 1572, 1662, 1753, 1845, 1945, 2049, 2156, 2264, 2380, 2499, 2623, 2750, 2882]