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.

Showing 1-2 of 2 results.

A091216 Numbers k such that numerator of Bernoulli(2*k) is divisible by 37, the first irregular prime.

Original entry on oeis.org

16, 34, 37, 52, 70, 74, 88, 106, 111, 124, 142, 148, 160, 178, 185, 196, 214, 222, 232, 250, 259, 268, 286, 296, 304, 322, 333, 340, 358, 370, 376, 394, 407, 412, 430, 444, 448, 466, 481, 484, 502, 518, 520, 538, 555, 556, 574, 592, 610, 628
Offset: 1

Views

Author

N. J. A. Sloane, Feb 24 2004

Keywords

Crossrefs

Programs

  • Mathematica
    Select[ Range[ 681], Mod[ Numerator[ BernoulliB[2# ]], 37] == 0 &] (* Robert G. Wilson v, Feb 24 2004 *)
  • PARI
    for(j=1,260, if (! (numerator(bernfrac(2*j))%37), print1(j, ", ")))

Extensions

More terms from Robert G. Wilson v, Feb 24 2004

A092221 Numbers k such that numerator of Bernoulli(2*k) is divisible by 59, the second irregular prime.

Original entry on oeis.org

22, 51, 59, 80, 109, 118, 138, 167, 177, 196, 225, 236, 254, 283, 295, 312, 341, 354, 370, 399, 413, 428, 457, 472, 486, 515, 531, 544, 573, 590, 602, 631, 649, 660, 689, 708, 718, 747, 767, 776, 805, 826, 834, 863, 885, 892, 921, 944, 950, 979, 1003, 1008
Offset: 1

Views

Author

Robert G. Wilson v, Feb 25 2004

Keywords

Comments

Satisfies a(n) = 2*a(n-3) - a(n-6) for n < 67. - Chai Wah Wu, May 28 2016

Crossrefs

Programs

  • Mathematica
    Select[ Range[ 1036], Mod[ Numerator[ BernoulliB[2# ]], 59] == 0 &]
  • PARI
    for(n=0, 10^3, if( numerator(bernfrac(2*n))%59==0, print1(n, ", ") ) ); \\ Joerg Arndt, May 29 2016
  • Python
    from sympy import bernoulli
    A092221_list = [n for n in range(10**3) if not bernoulli(2*n).p % 59] # Chai Wah Wu, May 28 2016
    
Showing 1-2 of 2 results.