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.

A320060 Least residue greater than -prime(n)/2 of the product Product_{i,j} (i^2 - (i+j)*j) modulo prime(n), where i and j run over {1,...,(prime(n)-1)/2} with i^2-(i+j)*j not divisible by prime(n).

Table of values

n a(n)
2 -1
3 -1
4 -1
5 1
6 5
7 -4
8 -1
9 1
10 1
11 1
12 -6
13 1
14 -1
15 -1
16 -23
17 -1
18 1
19 1
20 1
21 27
22 -1
23 -1
24 1
25 22
26 -1
27 1
28 1
29 -1
30 15
31 -1
32 1
33 37
34 -1
35 -1
36 1
37 28
38 -1
39 -1
40 80
41 -1
42 -1
43 1
44 -81
45 14
46 -1
47 1
48 1
49 1
50 1
51 -89
52 -1
53 1
54 1
55 16
56 1
57 -1
58 1
59 60
60 1
61 -1
62 -138
63 1
64 1
65 -25
66 -114
67 1
68 148
69 1
70 1
71 -42
72 -1
73 -1
74 -104
75 -1
76 1
77 -1
78 63
79 -1
80 -1

List of values

[-1, -1, -1, 1, 5, -4, -1, 1, 1, 1, -6, 1, -1, -1, -23, -1, 1, 1, 1, 27, -1, -1, 1, 22, -1, 1, 1, -1, 15, -1, 1, 37, -1, -1, 1, 28, -1, -1, 80, -1, -1, 1, -81, 14, -1, 1, 1, 1, 1, -89, -1, 1, 1, 16, 1, -1, 1, 60, 1, -1, -138, 1, 1, -25, -114, 1, 148, 1, 1, -42, -1, -1, -104, -1, 1, -1, 63, -1, -1]