|
|
|
|
1, 1, 1, 1, 5, 1, 7, 1, 1, 1, 11, 1, 13, 7, 5, 1, 17, 1, 19, 1, 1, 11, 23, 1, 25, 13, 1, 7, 29, 1, 31, 1, 11, 17, 35, 1, 37, 19, 13, 1, 41, 1, 43, 11, 5, 23, 47, 1, 49, 1, 17, 13, 53, 1, 5, 7, 19, 29, 59, 1, 61, 31, 1, 1, 65, 11, 67, 17, 23, 7, 71, 1, 73, 37
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
a(n) is the trivial factor of the numerator of Bernoulli(2n) that divides 2n.
The remaining part of the (unsigned) numerator equals a product of powers of irregular primes, or 1 if and only if n = 1, 2, 3, 4, 5, 7.
Alternatively, a(n) is the product over all prime powers p^e, where p^e is the highest power of p dividing 2n and p-1 does not divide 2n.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = numerator(Bernoulli(2n))/numerator(Bernoulli(2n)/(2n)).
a(n) = gcd(numerator(Bernoulli(2n)), 2n).
|
|
EXAMPLE
|
a(5) = 5, since Bernoulli(10) = 5/66 and Bernoulli(10)/10 = 1/132.
|
|
MAPLE
|
A300711 := proc(n) local P, F, f, divides; divides := (a, b) -> is(irem(b, a) = 0):
P := 1; F := ifactors(2*n)[2]; for f in F do if not divides(f[1]-1, 2*n) then
|
|
MATHEMATICA
|
Table[Numerator[BernoulliB[n]]/Numerator[BernoulliB[n]/n], {n, 2, 100, 2}]
|
|
PROG
|
(Julia)
using Nemo
b = bernoulli(n)
div(numerator(b), numerator(b*QQ(1, n)))
end
(PARI) a(n) = gcd(numerator(bernfrac(2*n)), 2*n) \\ Jianing Song, Apr 05 2021
(PARI) upto(N)=bernvec(N); forstep(n=2, 2*N, 2, print1(gcd(numerator(bernfrac(n)), n), ", ")) \\ Jeppe Stig Nielsen, Jun 22 2023
|
|
CROSSREFS
|
A111008 equals the first entries and slightly differs, see a(35).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|