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.

A085420 For each n, let p(n,b) be the smallest prime in the arithmetic progression k*n+b, with k > 0. Then a(n) = max(p(n,b)) with 0 < b < n and gcd(b,n) = 1.

Table of values

n a(n)
1 2
2 3
3 7
4 7
5 19
6 11
7 29
8 23
9 43
10 19
11 71
12 23
13 103
14 53
15 43
16 43
17 103
18 53
19 191
20 59
21 97
22 79
23 233
24 73
25 269
26 103
27 173
28 83
29 317
30 79
31 577
32 151
33 227
34 193
35 239
36 157
37 439
38 191
39 233
40 157
41 587
42 107
43 467
44 257
45 389
46 307
47 967
48 191
49 613
50 269
51 421
52 601
53 659
54 199
55 353
56 233
57 433
58 317
59 709

List of values

[2, 3, 7, 7, 19, 11, 29, 23, 43, 19, 71, 23, 103, 53, 43, 43, 103, 53, 191, 59, 97, 79, 233, 73, 269, 103, 173, 83, 317, 79, 577, 151, 227, 193, 239, 157, 439, 191, 233, 157, 587, 107, 467, 257, 389, 307, 967, 191, 613, 269, 421, 601, 659, 199, 353, 233, 433, 317, 709]