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.

A002068 Wilson remainders: a(n) = ((p-1)!+1)/p mod p, where p = prime(n).

Table of values

n a(n)
1 1
2 1
3 0
4 5
5 1
6 0
7 5
8 2
9 8
10 18
11 19
12 7
13 16
14 13
15 6
16 34
17 27
18 56
19 12
20 69
21 11
22 73
23 20
24 70
25 70
26 72
27 57
28 1
29 30
30 95
31 71
32 119
33 56
34 67
35 94
36 86
37 151
38 108
39 21
40 106
41 48
42 72
43 159
44 35
45 147
46 118
47 173
48 180
49 113
50 131
51 169
52 107
53 196
54 214
55 177
56 73
57 121
58 170
59 25
60 277
61 164
62 231
63 271
64 259
65 288
66 110

List of values

[1, 1, 0, 5, 1, 0, 5, 2, 8, 18, 19, 7, 16, 13, 6, 34, 27, 56, 12, 69, 11, 73, 20, 70, 70, 72, 57, 1, 30, 95, 71, 119, 56, 67, 94, 86, 151, 108, 21, 106, 48, 72, 159, 35, 147, 118, 173, 180, 113, 131, 169, 107, 196, 214, 177, 73, 121, 170, 25, 277, 164, 231, 271, 259, 288, 110]