OFFSET
1,3
COMMENTS
First nonzero value of q_p(m) mod p with gcd(m,p) = 1, where q_p(m) = (m^(p-1) - 1)/p is the Fermat quotient of p to the base m and p is the n-th prime p_n.
It is believed that a(n) = q_p(3) mod p, if p = p_n is a Wieferich prime A001220. See Section 1.1 in Ostafe-Shparlinski (2010).
LINKS
A. Ostafe and I. Shparlinski (2010), Pseudorandomness and Dynamics of Fermat Quotients
FORMULA
EXAMPLE
p_1 = 2 and (m^1 - 1)/2 = 0, 1 == 0, 1 (mod 2) for m = 1, 3, so a(1) = 1.
p_5 = 11 and (m^10 - 1)/11 = 0, 93 == 0, 5 (mod 7) for m = 1, 2, so a(4) = 5.
p_183 = 1093 and (m^1092 - 1)/1093 == 0, 0, 312 (mod 1093) for m = 1, 2, 3, so a(183) = 312.
Similarly, a(490) = 7.
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Sondow, Jun 24 2010
EXTENSIONS
Nonexistent A-numbers removed by Jonathan Sondow, Jun 26 2010
STATUS
approved