OFFSET
3,2
COMMENTS
LINKS
Romeo Mestrovic, A search for primes p such that Euler number E_p-3 is divisible by p, Mathematics of Computation 83 (2014), 2967-2976.
PROG
(PARI) eulmod(n) = abs(centerlift(Mod(eulerfrac(n-3), n)))
a(n) = my(p=prime(n)); eulmod(p)
CROSSREFS
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Apr 06 2022
STATUS
approved