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.

A238460 Primes p for which x! + (p-1)!/x!==0 (mod p) has only two solutions 1<=x<=p-2 following from Wilson theorem: x = 1 and x = p-2.

Table of values

n a(n)
1 5
2 13
3 37
4 41
5 101
6 113
7 157
8 173
9 181
10 197
11 229
12 241
13 281
14 313
15 337
16 349
17 353
18 373
19 409
20 421
21 433
22 509
23 541
24 617
25 677
26 701
27 757
28 761
29 769
30 773
31 821
32 929
33 941
34 977
35 997
36 1013
37 1093
38 1097
39 1109
40 1181
41 1193
42 1237
43 1409
44 1433
45 1481
46 1489
47 1669
48 1693
49 1721
50 1741

List of values

[5, 13, 37, 41, 101, 113, 157, 173, 181, 197, 229, 241, 281, 313, 337, 349, 353, 373, 409, 421, 433, 509, 541, 617, 677, 701, 757, 761, 769, 773, 821, 929, 941, 977, 997, 1013, 1093, 1097, 1109, 1181, 1193, 1237, 1409, 1433, 1481, 1489, 1669, 1693, 1721, 1741]