|
|
A272369
|
|
Numbers n such that Bernoulli number B_{n} has denominator 1410.
|
|
15
|
|
|
92, 184, 1564, 1748, 2116, 3496, 4232, 4324, 5428, 5612, 6532, 8648, 9476, 9844, 10028, 10856, 11224, 12604, 14444, 15364, 16652, 18124, 18952, 19412, 20056, 20884, 21068, 23644, 24932, 26036, 26588, 28612, 28796, 28888, 29164, 30728, 31004, 31924, 32108, 32476, 33304, 34868, 35236, 35788, 36248, 36524
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
1410 = 2 * 3 * 5 * 47.
All terms are multiple of a(1) = 92.
For these numbers numerator(B_{n}) mod denominator(B_{n}) = 1333.
|
|
LINKS
|
|
|
EXAMPLE
|
Bernoulli B_{92} is -1295585948207537527989427828538576749659341483719435143023316326829946247/1410, hence 92 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, 1410);
|
|
MATHEMATICA
|
Select[92 Range@ 360, Denominator@ BernoulliB@ # == 1410 &] (* Michael De Vlieger, Apr 28 2016 *)
|
|
PROG
|
(PARI) lista(nn) = for(n=1, nn, if(denominator(bernfrac(n)) == 1410, print1(n, ", "))); \\ Altug Alkan, Apr 28 2016
(Python)
from sympy import divisors, isprime
for i in range(92, 10**6, 92):
for d in divisors(i):
if d not in (1, 2, 4, 46) and isprime(d+1):
break
else:
|
|
CROSSREFS
|
Cf. A045979, A051222, A051225, A051226, A051227, A051228, A051229, A051230, A119456, A119480, A249134, A255684, A271634, A271635, A272138, A272139, A272140, A272183, A272184, A272185, A272186.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|