|
|
A236400
|
|
Primes p=prime(k) such that min{r_p, p-r_p} <= 2, where r_p = A100612(k).
|
|
1
|
|
|
2, 3, 5, 7, 11, 23, 31, 67, 227, 373, 10331, 274453
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MAPLE
|
local p, lf, kf, k ;
p := ithprime(n) ;
lf := 1 ;
kf := 1 ;
for k from 1 to p-1 do
kf := modp(kf*k, p) ;
lf := lf+modp(kf, p) ;
end do:
lf mod p ;
end proc:
for n from 1 do
p := ithprime(n) ;
prp := p-rp ;
if min(rp, prp) <= 2 then
print(p) ;
end if;
|
|
MATHEMATICA
|
A100612[n_] := Module[{p = Prime[n], lf = 1, kf = 1, k}, For[k = 1, k <= p - 1, k++, kf = Mod[kf*k, p]; lf = lf + Mod[kf, p]]; Mod[lf, p]];
|
|
PROG
|
(Python)
from sympy import isprime
def afind(limit):
f = 1 # (p-1)!
s = 2 # sum(0! + 1! + ... + (p-1)!)
for p in range(2, limit+1):
if isprime(p):
r_p = s%p
if min(r_p, p-r_p) <= 2:
print(p, end=", ")
s += f*p
f *= p
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|