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.

A257364 Least prime p such that pi(p*n)^2 = pi(q*n)^2 + pi(r*n)^2 for some primes q and r, where pi(x) denotes the number of primes not exceeding x.

Table of values

n a(n)
1 11
2 59
3 47
4 211
5 23
6 233
7 181
8 257
9 109
10 109
11 13
12 311
13 929
14 47
15 389
16 757
17 1747
18 13
19 67
20 2389
21 1087
22 569
23 311
24 853
25 103
26 5569
27 1399
28 3203
29 10891
30 3673
31 3793
32 1873
33 4357
34 41
35 2297
36 131
37 3253
38 6737
39 2621
40 5113
41 2879
42 953
43 6379
44 3539
45 12343
46 4337
47 6067
48 11939
49 43441
50 5179

List of values

[11, 59, 47, 211, 23, 233, 181, 257, 109, 109, 13, 311, 929, 47, 389, 757, 1747, 13, 67, 2389, 1087, 569, 311, 853, 103, 5569, 1399, 3203, 10891, 3673, 3793, 1873, 4357, 41, 2297, 131, 3253, 6737, 2621, 5113, 2879, 953, 6379, 3539, 12343, 4337, 6067, 11939, 43441, 5179]