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.

A260232 Least prime p such that pi(p*n) = n*pi(q*n) for some prime q.

Table of values

n a(n)
1 2
2 5
3 13
4 67
5 23
6 19
7 433
8 443
9 107
10 41
11 61
12 251
13 239
14 1987
15 541
16 491
17 1093
18 499
19 421
20 179
21 2137
22 1297
23 1097
24 101
25 103
26 2411
27 1283
28 1847
29 379
30 4993
31 8329
32 5563
33 4297
34 5639
35 9587
36 1867
37 5113
38 6691
39 3691
40 1193
41 4663
42 2971
43 27733
44 7121
45 593
46 2273
47 607
48 6047
49 4217
50 2609

List of values

[2, 5, 13, 67, 23, 19, 433, 443, 107, 41, 61, 251, 239, 1987, 541, 491, 1093, 499, 421, 179, 2137, 1297, 1097, 101, 103, 2411, 1283, 1847, 379, 4993, 8329, 5563, 4297, 5639, 9587, 1867, 5113, 6691, 3691, 1193, 4663, 2971, 27733, 7121, 593, 2273, 607, 6047, 4217, 2609]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.