|
%I #7 Apr 06 2022 08:45:28
%S 1,2,1,3,8,7,1,3,9,4,4,4,14,7,12,16,25,22,25,4,23,33,42,15,46,18,23,
%T 38,58,2,6,55,0,37,74,63,10,61,21,38,92,89,70,79,69,59,85,22,27,69,0,
%U 45,58,96,106,6,50,28,91,133,46,147,133,38,29,128,167,116
%N a(n) = abs(E_{p-3} (mod p)) for p = prime(n), where E_i is the i-th Euler number (A000364).
%C a(n) = 0 iff p is a term of A198245.
%C These are the absolute values of the "A-values" that can be used to define "near-misses" in a search for terms of A198245 (cf. Mestrovic, 2014).
%H Romeo Mestrovic, <a href="https://doi.org/10.1090/S0025-5718-2014-02814-7">A search for primes p such that Euler number E_p-3 is divisible by p</a>, Mathematics of Computation 83 (2014), 2967-2976.
%o (PARI) eulmod(n) = abs(centerlift(Mod(eulerfrac(n-3), n)))
%o a(n) = my(p=prime(n)); eulmod(p)
%Y Cf. A000364, A198245.
%Y A-values: A258367 (near-Wieferich), A250406 (near-Wilson), A244801 and A241014 (near-Wall-Sun-Sun), A260209 and A260210 (near-Wolstenholme), A338558 (near-misses for A007659).
%K nonn
%O 3,2
%A _Felix Fröhlich_, Apr 06 2022
|
