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.

A256572 Number of triples (x,x+1,x+2) with 1 < x <= p-3 of consecutive integers less than p whose product is 1 modulo p, where p = prime(n).

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 1
6 0
7 1
8 1
9 2
10 0
11 0
12 1
13 0
14 1
15 0
16 1
17 3
18 1
19 1
20 0
21 0
22 1
23 1
24 1
25 1
26 3
27 1
28 1
29 1
30 1
31 0
32 0
33 1
34 0
35 1
36 0
37 1
38 0
39 3
40 3
41 0
42 1
43 1
44 0
45 0
46 1
47 3
48 3
49 1
50 1
51 0
52 0
53 1
54 1
55 0
56 1
57 0
58 3
59 0
60 1
61 1
62 1
63 3
64 0
65 1
66 3
67 0
68 1
69 3
70 0
71 0
72 1
73 1
74 1
75 1
76 1
77 1
78 0
79 1
80 0
81 1
82 1
83 1
84 1
85 0
86 0
87 3
88 1
89 0
90 3
91 1
92 1
93 0
94 0
95 0
96 1
97 0
98 1
99 1
100 0
101 0
102 1
103 1
104 1
105 1
106 0
107 0
108 3
109 3
110 0
111 3
112 1
113 1
114 1
115 1
116 1
117 1
118 0
119 0
120 1
121 1
122 0
123 1
124 0
125 3
126 1
127 1
128 3
129 1
130 1
131 0
132 1
133 1
134 1
135 0
136 1
137 1
138 1
139 1
140 3
141 0
142 3
143 0
144 1
145 3
146 1
147 3
148 0
149 0
150 0
151 3
152 1
153 3
154 0
155 1
156 1
157 1
158 0
159 1
160 1
161 0
162 1
163 0
164 1
165 1
166 1
167 3
168 3

List of values

[0, 0, 0, 1, 1, 0, 1, 1, 2, 0, 0, 1, 0, 1, 0, 1, 3, 1, 1, 0, 0, 1, 1, 1, 1, 3, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 3, 3, 0, 1, 1, 0, 0, 1, 3, 3, 1, 1, 0, 0, 1, 1, 0, 1, 0, 3, 0, 1, 1, 1, 3, 0, 1, 3, 0, 1, 3, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 3, 1, 0, 3, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 3, 3, 0, 3, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 3, 1, 1, 3, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 3, 0, 3, 0, 1, 3, 1, 3, 0, 0, 0, 3, 1, 3, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 3, 3]