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.

A060276 a(1) = 2; a(n) = smallest prime > a(n-1) such that the sum of any three nondecreasing terms, chosen from a(1), ..., a(n-1) and a(n), is unique.

Table of values

n a(n)
1 2
2 3
3 7
4 19
5 59
6 73
7 211
8 257
9 631
10 919
11 1291
12 1979
13 3229
14 4397
15 5557
16 7151
17 10657
18 12049
19 17827
20 19577
21 25919
22 32143
23 35951
24 46141
25 54499
26 64433
27 81199
28 92507
29 116009
30 132511
31 145303
32 171763
33 193679
34 232417
35 260549
36 289573
37 302009
38 340111
39 424967
40 465151
41 506507

List of values

[2, 3, 7, 19, 59, 73, 211, 257, 631, 919, 1291, 1979, 3229, 4397, 5557, 7151, 10657, 12049, 17827, 19577, 25919, 32143, 35951, 46141, 54499, 64433, 81199, 92507, 116009, 132511, 145303, 171763, 193679, 232417, 260549, 289573, 302009, 340111, 424967, 465151, 506507]