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 A232040 #18 Nov 19 2013 14:15:47 %S A232040 1871,2531,3191,3851,5171,6491,7151,9791,13751,14411,15731,18371, %T A232040 19031,20747,21011,24851,24971,26951,27611,30911,34031,34211,34871, %U A232040 35531,36191,37511,37643,40151,41999,42131,43451,44111,44771,46091,46751,48731,49391 %N A232040 Primes p congruent to 11 mod 12 such that (p - 1)/2 does not divide the numerator of the Bernoulli number B(p-1). %C A232040 A prime p is in the sequence if p is of the form 660*n + 551. %H A232040 <a href="/index/Be#Bernoulli">Index entries for sequences related to Bernoulli numbers</a> %o A232040 (PARI) forstep(p=11, 49391, 12, if(isprime(p)&&!Mod(numerator(bernfrac(p-1)), (p-1)/2)==0, print1(p, ", "))); %Y A232040 Cf. A000367, A000928, A068231, A232039. %K A232040 nonn %O A232040 1,1 %A A232040 _Arkadiusz Wesolowski_, Nov 17 2013