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.

A256592 Let p = prime(n); a(n) = number of pairs (x,i) with i >= 2 and 2 <= x <= p-i such that x*(x+1)*(x+2)*...*(x+i-1) == 1 mod p.

Table of values

n a(n)
1 0
2 0
3 1
4 2
5 6
6 3
7 8
8 7
9 13
10 15
11 13
12 11
13 13
14 22
15 18
16 25
17 36
18 31
19 34
20 53
21 42
22 38
23 38
24 40
25 55
26 47
27 41
28 37
29 77
30 59
31 62
32 67
33 66
34 63
35 55
36 84
37 74
38 78
39 90
40 74
41 90
42 92
43 85
44 108
45 100
46 117
47 98
48 104
49 136
50 114
51 118
52 118
53 141
54 112
55 118
56 115
57 122
58 138
59 132
60 129
61 115
62 152

List of values

[0, 0, 1, 2, 6, 3, 8, 7, 13, 15, 13, 11, 13, 22, 18, 25, 36, 31, 34, 53, 42, 38, 38, 40, 55, 47, 41, 37, 77, 59, 62, 67, 66, 63, 55, 84, 74, 78, 90, 74, 90, 92, 85, 108, 100, 117, 98, 104, 136, 114, 118, 118, 141, 112, 118, 115, 122, 138, 132, 129, 115, 152]