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.
%I A271635 #27 Apr 29 2016 10:33:08
%S A271635 22,154,242,286,374,814,1034,1078,1298,1342,1474,1562,1694,1738,2134,
%T A271635 2222,2354,2794,3014,3058,3146,3278,3454,3586,3674,3982,4114,4246,
%U A271635 4334,4378,4906,4994,5654,5698,5786,5918,5962,6094,6226,6754,6842,6886,6974,7414,7634,7678,7766
%N A271635 Numbers n such that Bernoulli number B_{n} has denominator 138.
%C A271635 138 = 2 * 3 * 23.
%C A271635 All terms are multiple of a(1) = 22.
%C A271635 For these numbers numerator(B_{n}) mod denominator(B_{n}) = 17.
%H A271635 Seiichi Manyama, <a href="/A271635/b271635.txt">Table of n, a(n) for n = 1..1000</a>
%e A271635 Bernoulli B_{22} is 854513/138, hence 22 is in the sequence.
%p A271635 with(numtheory): P:=proc(q,h) local n; for n from 2 by 2 to q do
%p A271635 if denom(bernoulli(n))=h then print(n); fi; od; end: P(10^6,138);
%t A271635 Select[Range[0, 1000], Denominator[BernoulliB[#]] == 138 &] (* _Robert Price_, Apr 21 2016 *)
%o A271635 (PARI) isok(n) = denominator(bernfrac(n)) == 138; \\ _Michel Marcus_, Apr 22 2016
%Y A271635 Cf. A045979, A051222, A051225, A051226, A051227, A051228, A051229, A051230, A119456, A119480, A249134, A255684, A271634, A272138, A272139, A272140, A272183, A272184, A272185, A272186.
%K A271635 nonn,easy
%O A271635 1,1
%A A271635 _Paolo P. Lava_, Apr 21 2016
%E A271635 More terms from _Michel Marcus_, Apr 22 2016