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.

A001775 Numbers k such that 19*2^k - 1 is prime.

Original entry on oeis.org

1, 3, 5, 21, 41, 49, 89, 133, 141, 165, 189, 293, 305, 395, 651, 665, 771, 801, 923, 953, 3689, 5315, 6989, 15641, 48819, 78389, 134053, 167843, 181395, 311091, 353661, 645555, 916763
Offset: 1

Views

Author

Keywords

References

  • H. Riesel, "Prime numbers and computer methods for factorization", Progress in Mathematics, Vol. 57, Birkhäuser, Boston, 1985, Chap. 4, see pp. 381-384.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • H. C. Williams and C. R. Zarnke, Math. Comp., 22 (1968), 420-422.

Crossrefs

Cf. A032359 (19*2^k+1 is prime).

Programs

Extensions

More terms from Hugo Pfoertner, Jun 22 2004
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
Minor corrections by Charles R Greathouse IV, Aug 29 2010

A300408 Primes of the form 19*2^n + 1.

Original entry on oeis.org

1217, 19457, 1337006139375617
Offset: 1

Views

Author

Martin Renner, Mar 05 2018

Keywords

Comments

Next term a(4) = 19*2^366 + 1 > 10^111.
For the corresponding exponents n see A032359.

Crossrefs

Programs

  • GAP
    Filtered(List([1..500],n->19*2^n + 1),IsPrime); # Muniru A Asiru, Mar 06 2018
    
  • Maple
    a:=(n,k)->`if`(isprime(k*2^n+1), k*2^n+1, NULL):
    seq(a(n,19), n=1..366);
  • PARI
    lista(nn) = {for(k=1, nn, if(ispseudoprime(p=19*2^k+1), print1(p, ", ")));} \\ Altug Alkan, Mar 29 2018
Showing 1-2 of 2 results.