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.

A260888 Least prime p such that 2 + 3*pi(p*n) = 4*pi(q*n) for some prime q, where pi(x) denotes the number of primes not exceeding x.

Table of values

n a(n)
1 3
2 2
3 41
4 211
5 23
6 83
7 43
8 23
9 7
10 3
11 601
12 109
13 23
14 251
15 31
16 251
17 7
18 41
19 149
20 157
21 293
22 3
23 103
24 41
25 2083
26 233
27 7
28 647
29 1877
30 7
31 1117
32 599
33 7
34 937
35 487
36 7
37 251
38 149
39 7
40 439
41 83
42 3
43 7
44 43
45 643
46 7
47 157
48 157
49 1291
50 7

List of values

[3, 2, 41, 211, 23, 83, 43, 23, 7, 3, 601, 109, 23, 251, 31, 251, 7, 41, 149, 157, 293, 3, 103, 41, 2083, 233, 7, 647, 1877, 7, 1117, 599, 7, 937, 487, 7, 251, 149, 7, 439, 83, 3, 7, 43, 643, 7, 157, 157, 1291, 7]