OFFSET
1,1
COMMENTS
After computing the Euler numbers, finding the non-divisors is simple because the Euler numbers satisfy a Kummer congruence. See Wagstaff for details. The density of these primes is approximately 0.33.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..500 (terms 1..264 from T. D. Noe)
Samuel S. Wagstaff, Jr., Prime divisors of the Bernoulli and Euler numbers, in: Number Theory for the Millennium III, A K Peters, 2002, pp. 357-374.
Eric Weisstein's World of Mathematics, Euler Number
MATHEMATICA
ee=Table[Abs[EulerE[2i]], {i, 1000}]; t=Table[p=Prime[n]; cnt=0; Do[If[Mod[ee[[i]], p]==0, cnt++ ], {i, p}]; cnt, {n, PrimePi[1000]}]; Prime[Flatten[Position[t, 0]]]
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, Feb 25 2004
STATUS
approved
