OFFSET
1,1
COMMENTS
4686 = 2*3*11*71.
All terms are multiples of a(1) = 70.
For these numbers numerator(B_{k}) mod denominator(B_{k}) = 289.
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..1000
EXAMPLE
Bernoulli B_{70} is 1505381347333367003803076567377857208511438160235/4686, hence 70 is in the sequence.
MAPLE
with(numtheory): P:=proc(q, h) local n; for n from 2 by 2 to q do
if denom(bernoulli(n))=h then print(n); fi; od; end: P(10^6, 4686);
# Alternative: # according to Robert Israel code in A282773
with(numtheory): filter:= n ->
select(isprime, map(`+`, divisors(n), 1)) = {2, 3, 11, 71}:
select(filter, [seq(i, i=1..10^5)]);
MATHEMATICA
70 Position[Array[Denominator@ BernoulliB[70 #] &, 10^3], 4686][[All, 1]] (* Michael De Vlieger, Nov 27 2017 *)
Select[70*Range[750], Denominator[BernoulliB[#]]==4686&] (* Harvey P. Dale, Nov 23 2023 *)
PROG
(PARI) isok(n) = denominator(bernfrac(n)) == 4686; \\ Michel Marcus, Nov 27 2017
(PARI) lista(nn) = forstep(n=70, nn, 70, if(denominator(bernfrac(n)) == 4686, print1(n, ", "))) \\ Iain Fox, Nov 27 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paolo P. Lava, Nov 27 2017
STATUS
approved