cp's OEIS Frontend

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.

A321217 Genocchi irregular primes.

Original entry on oeis.org

17, 31, 37, 41, 43, 59, 67, 73, 89, 97, 101, 103, 109, 113, 127, 131, 137, 149, 151, 157, 193, 223, 229, 233, 241, 251, 257, 263, 271, 277, 281, 283, 293, 307, 311, 313, 331, 337, 347, 353, 379, 389, 397, 401, 409, 421, 431, 433, 439, 449, 457, 461, 463, 467, 491, 499
Offset: 1

Views

Author

Michel Marcus, Oct 31 2018

Keywords

Comments

An odd prime p is G-irregular if it divides at least one of the integers G2, G4, ..., G(p-3).
Conjecture (Hu et al., 2019): The asymptotic density of this sequence within the primes is 1 - 3*A/(2*sqrt(e)) = 0.659776..., where A is Artin's constant (A005596). - Amiram Eldar, Dec 06 2022

Crossrefs

Cf. A036968 (Genocchi numbers), A000928 (irregular primes), A120337 (Euler-irregular primes), A128197 (strong irregular primes), A250216 (weak irregular primes), A005596.

Programs

  • Maple
    A321217_list := proc(bound)
       local ae, F, p, m, maxp; F := NULL;
       for m from 2 by 2 to bound do
          p := nextprime(m+1);
          ae := abs(m*euler(m-1, 0));
          maxp := min(ae, bound);
          while p <= maxp do
              if ae mod p = 0 then F := F, p fi;
              p := nextprime(p)
          od
       od;
    sort({F}) end: A321217_list(500); # Peter Luschny, Nov 11 2018
  • Mathematica
    G[n_] := G[n] = n EulerE[n - 1, 0];
    GenocchiIrregularQ[p_] := AnyTrue[Table[G[k], {k, 2, p-3, 2}], Divisible[#, p]&];
    Select[Prime[Range[2, 100]], GenocchiIrregularQ] (* Jean-François Alcover, Nov 16 2018 *)

Extensions

More terms from Peter Luschny, Nov 11 2018