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.

A145354 It is conjectured that for each m >= 1 there exist primes Q=Q(m) and P=P(m) with (2m)^2 + 1 <= Q <= (2m+1)^2 - 2m <= P <= (2m+1)^2; then set a(2m-1) = Q, a(2m) = P.

Table of values

n a(n)
1 5
2 7
3 17
4 23
5 37
6 43
7 67
8 73
9 101
10 113
11 149
12 157
13 197
14 211
15 257
16 277
17 331
18 347
19 401
20 421
21 487
22 509
23 577
24 601
25 677
26 709
27 787
28 821
29 907
30 937
31 1031
32 1061
33 1163
34 1193
35 1297
36 1361
37 1447
38 1483
39 1601
40 1657
41 1777
42 1811
43 1949
44 1987
45 2129
46 2179
47 2309
48 2357
49 2503
50 2551

List of values

[5, 7, 17, 23, 37, 43, 67, 73, 101, 113, 149, 157, 197, 211, 257, 277, 331, 347, 401, 421, 487, 509, 577, 601, 677, 709, 787, 821, 907, 937, 1031, 1061, 1163, 1193, 1297, 1361, 1447, 1483, 1601, 1657, 1777, 1811, 1949, 1987, 2129, 2179, 2309, 2357, 2503, 2551]