|
|
A125636
|
|
Smallest odd prime base q such that p^2 divides q^(p-1) - 1, where p = prime(n).
|
|
19
|
|
|
5, 17, 7, 19, 3, 19, 131, 127, 263, 41, 229, 691, 313, 19, 53, 521, 53, 601, 1301, 11, 619, 31, 269, 3187, 53, 181, 43, 317, 499, 373, 911, 659, 19, 3659, 313, 751, 233, 4373, 3307, 419, 2591, 313, 1249, 2897, 349, 709, 331, 1973, 1933, 503, 821, 977, 2371, 263
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MAPLE
|
a:= proc(p)
local q;
q:= 3;
while (q &^ (p-1) - 1) mod p^2 <> 0 do
q:= nextprime(q)
od:
q
end proc:
|
|
MATHEMATICA
|
Table[Function[p, q = 3; While[! Divisible[q^(p - 1) - 1, p^2], q = NextPrime@ q]; q]@ Prime@ n, {n, 54}] (* Michael De Vlieger, Feb 12 2017 *)
|
|
PROG
|
(PARI) a(n) = {p = prime(n); forprime(q=3, , if (Mod(q, p^2)^(p-1) == 1, return (q)); ); } \\ Michel Marcus, Nov 24 2014
|
|
CROSSREFS
|
Cf. A125637 (analogous with p^3 instead of p^2).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|