OFFSET
1,1
COMMENTS
Least k such that k!*B(2n) is an integer where B(2n) denotes the 2n-th Bernoulli number.
a((p-1)/2) = p, where p is odd prime. All odd primes appear in this sequence. The very first appearance of odd prime p is a((p-1)/2). - Alexander Adamchuk, Jul 31 2006
Conjecture: a(n) is the largest prime p <= 2n+1 such that p * A000367(n) == - A002445(n) (mod p^2) for n > 0. Note that 2^(2n) == 1 (mod a(n)), since a(n) is the largest prime p such that b^(2n)== 1 (mod p) for every b coprime to p; i.e., a(n) is the largest prime p such that p-1 | 2n. - Thomas Ordowski, May 17 2020
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MATHEMATICA
Table[FactorInteger[Denominator[BernoulliB[2n]]][[ -1, 1]], {n, 100}]
PROG
(PARI)
a(n)=
{
my(bd=1);
forprime (p=2, 2*n+1, if( (2*n)%(p-1)==0, bd=p ) );
return(bd);
}
/* Joerg Arndt, May 06 2012 */
(PARI) a(n)=my(p); fordiv(n, d, if(isprime(p=2*n/d+1), return(p))) \\ Charles R Greathouse IV, Jun 08 2020
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Aug 23 2002
STATUS
approved