| Displaying 1-2 of 2 results found.
page
1
a(n) = |{0 < g < prime(n): g is a primitive root modulo prime(n) of the form k^2 + 1}|.
+10
14
1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 1, 3, 2, 2, 3, 4, 4, 4, 2, 1, 2, 1, 3, 3, 6, 3, 3, 7, 4, 5, 2, 8, 3, 5, 6, 1, 2, 5, 8, 10, 7, 3, 2, 6, 8, 2, 3, 5, 8, 4, 7, 4, 2, 5, 8, 9, 10, 5, 8, 6, 10, 6, 4, 9, 6, 9, 5, 3, 13, 5, 8, 9, 5, 6, 8, 13, 13, 6, 6, 5
Number of triangular numbers below prime(n) which are also primitive roots modulo prime(n).
+10
7
1, 0, 1, 1, 1, 1, 3, 3, 3, 4, 2, 1, 3, 2, 3, 3, 3, 3, 1, 3, 3, 4, 5, 5, 3, 5, 4, 9, 3, 7, 6, 4, 7, 3, 9, 3, 7, 5, 10, 9, 10, 9, 5, 10, 7, 7, 2, 5, 8, 6, 8, 7, 6, 6, 12, 10, 8, 9, 7, 10, 8, 11, 6, 6, 12, 14, 8, 7, 16, 5, 11, 10, 9, 6, 14, 14, 11, 8, 14, 7
Search completed in 0.004 seconds
|