Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084793
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
1
0, 0, 1, 3, 2, 4, 10, 3, 13, 15, 7, 7, 16, 16, 27, 25, 20, 13, 18, 30, 29, 30, 32, 51, 33, 34, 37, 44, 21, 53, 27, 39, 62, 35, 69, 28, 43, 43, 93, 89, 74, 42, 94, 62, 81, 54, 35, 73, 98, 74, 110, 101, 67, 86, 120, 143, 121, 109, 96, 89, 84, 135, 102, 139, 108, 159, 99, 108 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research