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.

Showing 1-4 of 4 results.

A250215 Least k such that the n-th weak irregular prime (A250216(n)) divides A241601(k).

Original entry on oeis.org

11, 23, 32, 13, 15, 44, 7, 27, 29, 19, 63, 24, 22, 43, 129, 130, 62, 75, 133, 84, 211, 127, 164, 100, 84, 9, 20, 156, 88, 87, 280, 19, 71, 125, 163, 100, 200, 382, 126, 159, 240, 215, 196, 130, 94, 292, 141, 400, 86, 270, 222, 175, 389, 52, 45, 22, 592, 522, 20
Offset: 1

Views

Author

Eric Chen, Dec 26 2014

Keywords

Comments

A prime p can divide A241601(k) for more than one k; the first few examples are as follows:
p k
67 27, 58
101 63, 68
149 130, 147
157 62, 110
241 211, 239
263 100, 213
307 88, 91, 137
311 87, 193, 292
349 19, 257
353 71, 186, 300
etc.

Examples

			19 is the first weak irregular prime and divides A241601(11) = 50521, so a(1) = 11.
		

Crossrefs

Extensions

More terms from Jinyuan Wang, Feb 18 2022

A061653 Relative class number h- of cyclotomic field Q(zeta_n).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 8, 1, 9, 1, 1, 1, 1, 1, 37, 1, 2, 1, 121, 1, 211, 1, 1, 3, 695, 1, 43, 1, 5, 3, 4889, 1, 10, 2, 9, 8, 41241, 1, 76301, 9, 7, 17, 64, 1, 853513, 8, 69, 1, 3882809, 3, 11957417, 37, 11, 19, 1280, 2, 100146415
Offset: 1

Views

Author

N. J. A. Sloane, Jun 16 2001

Keywords

Comments

Note that if n == 2 (mod 4), Q(zeta_n) is the same field as Q(zeta_{n/2}).
From Richard N. Smith, Jul 15 2019: (Start)
For prime p, p divides a(p) (or a(2p)) if and only if p is in A000928.
For prime p, p divides a(4p) if and only if p is in A250216. (End)

Examples

			Q(zeta_23) = 3 is the first time that h- is bigger than 1.
		

Crossrefs

Contains A000927, A035115, A061494 as subsequences.

Formula

For prime p, a(p) = A000927(A000720(p)).

Extensions

Washington gives an extensive table on pp. 353-360.
Missing term a(1) = 1 inserted by N. J. A. Sloane, Feb 05 2009 at the suggestion of Tanya Khovanova
More terms from R. J. Mathar, Feb 06 2009
a(59) changed from 41421 to 41241 (given correctly in 2nd edition of Washington), Matthew Johnson, Jul 20 2013
a(59) in b-file changed as above by Andrew Howroyd, Feb 23 2018
a(97) corrected, a(163) added by Max Alekseyev, Mar 05 2018

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

A250214 Number of values of k such that prime(n) divides A241601(k).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 2, 1, 0, 1, 0, 0, 0, 2, 1, 0, 0, 0, 0, 1, 1, 1, 2, 0, 2, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 2, 1, 1, 2, 0, 1, 1, 0, 1, 1, 3, 3, 0, 0, 0, 0, 1, 2, 3, 1, 0, 1, 3, 0, 1, 0, 1, 1, 1, 1, 0, 2, 0, 0, 0, 0, 2, 2, 2, 0, 0, 4, 0, 0, 1, 0, 1, 2, 2, 1, 2, 0, 1, 3, 3, 1, 0, 0, 1, 1, 3, 3, 2, 0, 0, 3, 1, 1
Offset: 1

Views

Author

Eric Chen, Dec 26 2014

Keywords

Comments

a(n) is called the weak irregular index of n-th prime, that is, the Bernoulli irregular index + Euler irregular index.
Prime(n) is a regular prime if and only if a(n) = 0.
Does every natural number appear in this sequence? For example, for the primes 491 and 1151, a(94) = a(190) = 4. (491 and 1151 are the only primes below 1800 with weak irregular index 4 or more.) However, does a(n) have a limit?

Examples

			a(8) = 1 since the 8th prime is 19, which divides A241601(11).
a(13) = 0 since the 13th prime is 41, a regular prime.
a(19) = 2 since the 19th prime is 67, which divides both A241601(27) and A241601(58).
		

Crossrefs

Showing 1-4 of 4 results.