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.

A242755 Primes p such that pi(p)*q == 1 (mod p) for some prime q < p, where pi(p) is the number of primes not exceeding p.

Table of values

n a(n)
1 3
2 5
3 7
4 13
5 17
6 29
7 31
8 41
9 59
10 61
11 73
12 127
13 157
14 173
15 179
16 199
17 223
18 227
19 239
20 241
21 271
22 281
23 311
24 317
25 349
26 353
27 359
28 367
29 379
30 419
31 439
32 479
33 487
34 503
35 541
36 557
37 599
38 643
39 653
40 709
41 769
42 773
43 809
44 823
45 829
46 839
47 859
48 941
49 953
50 1063

List of values

[3, 5, 7, 13, 17, 29, 31, 41, 59, 61, 73, 127, 157, 173, 179, 199, 223, 227, 239, 241, 271, 281, 311, 317, 349, 353, 359, 367, 379, 419, 439, 479, 487, 503, 541, 557, 599, 643, 653, 709, 769, 773, 809, 823, 829, 839, 859, 941, 953, 1063]