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.

A210475 Let p_(4,1)(m) be the m-th prime == 1 (mod 4). Then a(n) is the smallest p_(4,1)(m) such that the interval(p_(4,1)(m)*n, p_(4,1)(m+1)*n) contains exactly one prime == 1 (mod 4).

Table of values

n a(n)
2 13
3 13
4 29
5 13
6 193
7 97
8 97
9 277
10 457
11 1193
12 109
13 229
14 937
15 397
16 349
17 1597
18 2137
19 937
20 5569
21 5737
22 2833
23 1549
24 6733
25 7477
26 5077
27 3457
28 877
29 4153
30 12277
31 11113
32 8689
33 14029
34 11113
35 5233
36 24109
37 14737
38 26713
39 1297
40 77797
41 12097
42 51577
43 57973
44 33409
45 30493
46 49429
47 112237
48 10333
49 143137

List of values

[13, 13, 29, 13, 193, 97, 97, 277, 457, 1193, 109, 229, 937, 397, 349, 1597, 2137, 937, 5569, 5737, 2833, 1549, 6733, 7477, 5077, 3457, 877, 4153, 12277, 11113, 8689, 14029, 11113, 5233, 24109, 14737, 26713, 1297, 77797, 12097, 51577, 57973, 33409, 30493, 49429, 112237, 10333, 143137]