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.

A113161 a(1) = 1; for n > 1, a(n) = largest prime <= a(n-1) + n - 1.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 11
7 17
8 23
9 31
10 37
11 47
12 53
13 61
14 73
15 83
16 97
17 113
18 127
19 139
20 157
21 173
22 193
23 211
24 233
25 257
26 281
27 307
28 331
29 359
30 383
31 409
32 439
33 467
34 499
35 523
36 557
37 593
38 619
39 653
40 691
41 727
42 761
43 797
44 839
45 883
46 919
47 953
48 997
49 1039
50 1087
51 1129
52 1171
53 1223
54 1259
55 1307

List of values

[1, 2, 3, 5, 7, 11, 17, 23, 31, 37, 47, 53, 61, 73, 83, 97, 113, 127, 139, 157, 173, 193, 211, 233, 257, 281, 307, 331, 359, 383, 409, 439, 467, 499, 523, 557, 593, 619, 653, 691, 727, 761, 797, 839, 883, 919, 953, 997, 1039, 1087, 1129, 1171, 1223, 1259, 1307]