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.

A258818 a(n) = (!0 + !1 + ... + !(p-1)) mod p, where p = prime(n).

Table of values

n a(n)
1 1
2 2
3 3
4 0
5 4
6 9
7 13
8 4
9 14
10 25
11 4
12 30
13 4
14 9
15 32
16 30
17 45
18 48
19 12
20 7
21 34
22 74
23 40
24 76
25 96
26 57
27 64
28 90
29 89
30 50
31 117
32 87
33 29
34 46
35 108
36 113
37 10
38 70
39 111
40 150
41 14
42 153
43 119
44 26
45 81
46 78
47 112
48 209
49 173
50 177
51 186
52 126
53 26
54 25
55 60
56 74
57 23
58 27
59 138
60 49
61 72
62 211
63 252
64 169

List of values

[1, 2, 3, 0, 4, 9, 13, 4, 14, 25, 4, 30, 4, 9, 32, 30, 45, 48, 12, 7, 34, 74, 40, 76, 96, 57, 64, 90, 89, 50, 117, 87, 29, 46, 108, 113, 10, 70, 111, 150, 14, 153, 119, 26, 81, 78, 112, 209, 173, 177, 186, 126, 26, 25, 60, 74, 23, 27, 138, 49, 72, 211, 252, 169]