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.

A063980 Pillai primes: primes p such that there exists an integer m such that m! + 1 == 0 (mod p) and p != 1 (mod m).

Table of values

n a(n)
1 23
2 29
3 59
4 61
5 67
6 71
7 79
8 83
9 109
10 137
11 139
12 149
13 193
14 227
15 233
16 239
17 251
18 257
19 269
20 271
21 277
22 293
23 307
24 311
25 317
26 359
27 379
28 383
29 389
30 397
31 401
32 419
33 431
34 449
35 461
36 463
37 467
38 479
39 499
40 503
41 521
42 557
43 563
44 569
45 571
46 577
47 593
48 599
49 601
50 607

List of values

[23, 29, 59, 61, 67, 71, 79, 83, 109, 137, 139, 149, 193, 227, 233, 239, 251, 257, 269, 271, 277, 293, 307, 311, 317, 359, 379, 383, 389, 397, 401, 419, 431, 449, 461, 463, 467, 479, 499, 503, 521, 557, 563, 569, 571, 577, 593, 599, 601, 607]