cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A272140 Numbers n such that Bernoulli number B_{n} has denominator 1590.

This page as a plain text file.
%I A272140 #25 Apr 29 2016 09:28:03
%S A272140 52,104,988,1976,3068,3172,5252,5356,5564,6136,6344,7124,7748,8164,
%T A272140 8684,10244,10712,12532,13364,13676,13988,14092,16276,16328,17212,
%U A272140 17368,17524,18044,18356,19084,19916,20228,20488,20644,22828,23348,23764
%N A272140 Numbers n such that Bernoulli number B_{n} has denominator 1590.
%C A272140 1590 = 2 * 3 * 5 * 53.
%C A272140 All terms are multiple of a(1) = 52.
%C A272140 For these numbers numerator(B_{n}) mod denominator(B_{n}) = 1507.
%H A272140 Seiichi Manyama, <a href="/A272140/b272140.txt">Table of n, a(n) for n = 1..1000</a>
%e A272140 Bernoulli B_{52} is -801165718135489957347924991853/1590, hence 52 is in the sequence.
%p A272140 with(numtheory): P:=proc(q,h) local n;  for n from 2 by 2 to q do
%p A272140 if denom(bernoulli(n))=h then print(n); fi; od; end: P(10^6,1590);
%t A272140 Select[Range[0, 1000], Denominator[BernoulliB[#]] == 1590 &] (* _Robert Price_, Apr 21 2016 *)
%o A272140 (PARI) isok(n) = denominator(bernfrac(n)) == 1590; \\ _Michel Marcus_, Apr 22 2016
%Y A272140 Cf. A045979, A051222, A051225, A051226, A051227, A051228, A051229, A051230, A119456, A119480, A249134, A255684, A271634, A271635, A272138, A272139, A272183, A272184, A272185, A272186.
%K A272140 nonn
%O A272140 1,1
%A A272140 _Paolo P. Lava_, Apr 21 2016
%E A272140 a(12)-a(15) from _Michel Marcus_, Apr 22 2016
%E A272140 More terms from _Altug Alkan_, Apr 22 2016