For p = prime(n), the number of solutions (g,h) to the equation g^h == h (mod p), where 0 < h < p and g is a primitive root of p; fixed points of the discrete logarithm with base g.

A084793

For p = prime(n), the number of solutions (g,h) to the equation g^h == h (mod p), where 0 < h < p and g is a primitive root of p; fixed points of the discrete logarithm with base g.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =3a(4) =2a(5) =4a(6) =10a(7) =3a(8) =13a(9) =15a(10) =7a(11) =7a(12) =16a(13) =16a(14) =27a(15) =25a(16) =20a(17) =13a(18) =18a(19) =30a(20) =29a(21) =30a(22) =32a(23) =51a(24) =33a(25) =34a(26) =37a(27) =44a(28) =21a(29) =53

External references