A088592 - cp's OEIS frontend

A088592 Let p be the n-th 4k+3 prime (A002145), g be any primitive root of p. The mapping x->g^x mod p gives a permutation of {1,2,...,p-1}. a(n) is 0 if the permutation is even for each g, 1 if odd for each g.

n	a(n)
1	1
2	0
3	0
4	0
5	1
6	1
7	0
8	0
9	1
10	0
11	1
12	0
13	1
14	0
15	1
16	0
17	0
18	1
19	1
20	0
21	1
22	0
23	0
24	0
25	1
26	1
27	0
28	1
29	1
30	0
31	1
32	1
33	1
34	1
35	1
36	0
37	1
38	0
39	1
40	0
41	0
42	0
43	1
44	0
45	1
46	1
47	0
48	1
49	0
50	1
51	0
52	0
53	1
54	0
55	0
56	1
57	0
58	0
59	0
60	0
61	1
62	1
63	1
64	0
65	0
66	1
67	0
68	0
69	0
70	1
71	0
72	1
73	0
74	1
75	0
76	1
77	0
78	1
79	0
80	1
81	1
82	1
83	0
84	1
85	1
86	1
87	0
88	0
89	1
90	1
91	0
92	1
93	0
94	0
95	1
96	0
97	0
98	1
99	1
100	0
101	1
102	1

[1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1]

cp's OEIS Frontend

A088592 Let p be the n-th 4k+3 prime (A002145), g be any primitive root of p. The mapping x->g^x mod p gives a permutation of {1,2,...,p-1}. a(n) is 0 if the permutation is even for each g, 1 if odd for each g.

Table of values

List of values

n	a(n)
1	1
2	0
3	0
4	0
5	1
6	1
7	0
8	0
9	1
10	0
11	1
12	0
13	1
14	0
15	1
16	0
17	0
18	1
19	1
20	0
21	1
22	0
23	0
24	0
25	1
26	1
27	0
28	1
29	1
30	0
31	1
32	1
33	1
34	1
35	1
36	0
37	1
38	0
39	1
40	0
41	0
42	0
43	1
44	0
45	1
46	1
47	0
48	1
49	0
50	1
51	0
52	0
53	1
54	0
55	0
56	1
57	0
58	0
59	0
60	0
61	1
62	1
63	1
64	0
65	0
66	1
67	0
68	0
69	0
70	1
71	0
72	1
73	0
74	1
75	0
76	1
77	0
78	1
79	0
80	1
81	1
82	1
83	0
84	1
85	1
86	1
87	0
88	0
89	1
90	1
91	0
92	1
93	0
94	0
95	1
96	0
97	0
98	1
99	1
100	0
101	1
102	1

n	a(n)
1	1
2	0
3	0
4	0
5	1
6	1
7	0
8	0
9	1
10	0
11	1
12	0
13	1
14	0
15	1
16	0
17	0
18	1
19	1
20	0
21	1
22	0
23	0
24	0
25	1
26	1
27	0
28	1
29	1
30	0
31	1
32	1
33	1
34	1
35	1
36	0
37	1
38	0
39	1
40	0
41	0
42	0
43	1
44	0
45	1
46	1
47	0
48	1
49	0
50	1
51	0
52	0
53	1
54	0
55	0
56	1
57	0
58	0
59	0
60	0
61	1
62	1
63	1
64	0
65	0
66	1
67	0
68	0
69	0
70	1
71	0
72	1
73	0
74	1
75	0
76	1
77	0
78	1
79	0
80	1
81	1
82	1
83	0
84	1
85	1
86	1
87	0
88	0
89	1
90	1
91	0
92	1
93	0
94	0
95	1
96	0
97	0
98	1
99	1
100	0
101	1
102	1

n	a(n)
1	1
2	0
3	0
4	0
5	1
6	1
7	0
8	0
9	1
10	0
11	1
12	0
13	1
14	0
15	1
16	0
17	0
18	1
19	1
20	0
21	1
22	0
23	0
24	0
25	1
26	1
27	0
28	1
29	1
30	0
31	1
32	1
33	1
34	1
35	1
36	0
37	1
38	0
39	1
40	0
41	0
42	0
43	1
44	0
45	1
46	1
47	0
48	1
49	0
50	1
51	0
52	0
53	1
54	0
55	0
56	1
57	0
58	0
59	0
60	0
61	1
62	1
63	1
64	0
65	0
66	1
67	0
68	0
69	0
70	1
71	0
72	1
73	0
74	1
75	0
76	1
77	0
78	1
79	0
80	1
81	1
82	1
83	0
84	1
85	1
86	1
87	0
88	0
89	1
90	1
91	0
92	1
93	0
94	0
95	1
96	0
97	0
98	1
99	1
100	0
101	1
102	1