The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A352858 a(n) = abs(E_{p-3} (mod p)) for p = prime(n), where E_i is the i-th Euler number (A000364). 0
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, 38, 58, 2, 6, 55, 0, 37, 74, 63, 10, 61, 21, 38, 92, 89, 70, 79, 69, 59, 85, 22, 27, 69, 0, 45, 58, 96, 106, 6, 50, 28, 91, 133, 46, 147, 133, 38, 29, 128, 167, 116 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,2
COMMENTS
a(n) = 0 iff p is a term of A198245.
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).
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
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).
Sequence in context: A137307 A256420 A205391 * A078045 A202624 A342224
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Apr 06 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 19:55 EDT 2024. Contains 372919 sequences. (Running on oeis4.)