A090947 -id:A090947 - cp's OEIS frontend

A326727 The prime factorization of abs(numerator(B(2k))) for k >= 5, B(k) the k-th Bernoulli number. Factors sorted by size with the smallest factor negated. a(n) = -1 by convention for 1 <= n <= 5.

-1, -1, -1, -1, -1, -5, -691, -7, -3617, -43867, -283, 617, -11, 131, 593, -103, 2294797, -13, 657931, -7, 9349, 362903, -5, 1721, 1001259881, -37, 683, 305065927, -17, 151628697551, -26315271553053477373, -19, 154210205991661, -137616929, 1897170067619

Offset: 1

Peter Luschny, Jul 28 2019

For small Bernoulli numbers the factorizations were computed with SageMath, see the b-file for the script. For larger Bernoulli numbers the values were taken from the table of S. S. Wagstaff, Jr..
The smallest factor was negated only to be able to distinguish the individual factorizations easily. (No general formula for the number of factors is known.)
The factorizations listed in the b-file currently go up to B(204) (the prime factors of numerator(B(206)) are not yet known).

			The data is given as a flatted list of factorizations written with the conventions
stated above. Because it is a list the offset is 1. The list starts:
[[-1], [-1], [-1], [-1], [-1], [-5], [-691], [-7], [-3617], [-43867], [-283, 617], [-11, 131, 593], [-103, 2294797], [-13, 657931], [-7, 9349, 362903], ... ].
.
The first few factorizations are:
B(10) = 5;
B(12) = 691;
B(14) = 7;
B(16) = 3617;
B(18) = 43867;
B(20) = 283 * 617;
B(22) = 11 * 131 * 593;
B(24) = 103 * 2294797;
B(26) = 13 * 657931;
B(28) = 7 * 9349 * 362903;
B(30) = 5 * 1721 * 1001259881;

Peter Luschny, Table of n, a(n) for n = 1..460
factordb, Status of numerator(B(206)).
S. S. Wagstaff, Prime factors of the absolute values of Bernoulli numerators

Cf. A000367, A079294, A090947, A326726.

Sage
```
# See b-file.
```

A332300 The least prime factor of the numerator of Bernoulli(2*n), or 1 if the numerator is 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 5, 691, 7, 3617, 43867, 283, 11, 103, 13, 7, 5, 37, 17, 26315271553053477373, 19, 137616929, 1520097643918070802691, 11, 23, 653, 5, 13, 39409, 7, 29, 2003, 31, 1226592271, 11, 17, 5, 3112655297839, 37, 19, 13, 631, 41, 233, 43, 11, 5, 23, 47, 7823741903

Offset: 0

Amiram Eldar, Feb 09 2020

nonn

a(n)=5 if and only if n is in A017329. - Robert Israel, Feb 09 2020
From Chai Wah Wu, Feb 10 2020: (Start)
For n > 1, clearly if a(n) = n, then n is prime. However, the converse is not true. Prime numbers p such that a(p) != p are: 2, 3, 109, 167, 211, 227, 271, ...
Conjecture: for prime p > 3, p is a prime factor of the numerator of Bernoulli(2*p), thus the conjecture implies that a(p) <= p for prime p.
(End)

			a(10) = 283, since Bernoulli(2*10) = -174611/330, and 283 is the least prime factor of its numerator, 174611 = 283 * 617.

Chai Wah Wu, Table of n, a(n) for n = 0..191 (n = 0..103 from Amiram Eldar)
S. S. Wagstaff, Jr., Factors of Bernoulli numbers.

Cf. A000367, A017329, A020639, A079294, A090947, A242193, A326727.

[n le 4 select 1 else Min(PrimeDivisors(Abs(Numerator(Bernoulli(2*n))))):n in [0..48]]; // Marius A. Burtea, Feb 09 2020

Array[FactorInteger[Abs @ Numerator @  BernoulliB[2*#]][[1, 1]] &, 30, 0]

a(n) = my(x=abs(numerator(bernfrac(2*n)))); if (x==1, 1, vecmin(factor(x)[,1])); \\ Michel Marcus, Feb 09 2020

from sympy import bernoulli, primefactors
def A332300(n):
    x = abs(bernoulli(2*n).p)
    return 1 if x == 1 else min(primefactors(x)) # Chai Wah Wu, Feb 10 2020

a(n) = A020639(abs(A000367(n))).

cp's OEIS Frontend

A326727 The prime factorization of abs(numerator(B(2k))) for k >= 5, B(k) the k-th Bernoulli number. Factors sorted by size with the smallest factor negated. a(n) = -1 by convention for 1 <= n <= 5.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Sage

A332300 The least prime factor of the numerator of Bernoulli(2*n), or 1 if the numerator is 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Formula