This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A092219 #8 Feb 16 2025 08:32:52
%S A092219 0,0,4,0,0,12,16,10,0,28,22,36,40,12,14,52,0,6,26,28,72,18,0,88,96,62,
%T A092219 0,0,108,112,0,0,42,128,146,0,156,0,0,172,0,180,0,74,196,0,0,132,0,
%U A092219 228,232,0,210,126,256,212,268,0,8,280,0,292,90,86,312,316,0,336,0,18,70
%N A092219 Least even k such that the Euler number E(k) is divisible by prime(n), or 0 if there is no k.
%C A092219 A prime p will either divide an Euler number E(k) for k < p or divide no Euler number. This sequence can be used to find A092218, primes that divide Euler numbers and A092217, primes that divide no Euler number.
%H A092219 T. D. Noe, <a href="/A092219/b092219.txt">Table of n, a(n) for n = 1..850</a>
%H A092219 S. S. Wagstaff, Jr., <a href="http://www.cerias.purdue.edu/homes/ssw/bernoulli/full.pdf">Prime divisors of the Bernoulli and Euler numbers</a>
%H A092219 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EulerNumber.html">Euler Number</a>
%t A092219 ee=Table[Abs[EulerE[2i]], {i, 500}]; Table[p=Prime[n]; i=1; While[i<=p && Mod[ee[[i]], p]>0, i++ ]; If[i>p, 0, 2i], {n, PrimePi[500]}]
%Y A092219 Cf. A000364 (Euler numbers).
%K A092219 nonn
%O A092219 1,3
%A A092219 _T. D. Noe_, Feb 25 2004