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.
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.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =0a(4) =1a(5) =1a(6) =0a(7) =0a(8) =1a(9) =0a(10) =1a(11) =0a(12) =1a(13) =0a(14) =1a(15) =0a(16) =0a(17) =1a(18) =1a(19) =0a(20) =1a(21) =0a(22) =0a(23) =0a(24) =1a(25) =1a(26) =0a(27) =1a(28) =1a(29) =0
External references
- oeis: A088592