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.

A003617 Smallest n-digit prime.

Original entry on oeis.org

2, 11, 101, 1009, 10007, 100003, 1000003, 10000019, 100000007, 1000000007, 10000000019, 100000000003, 1000000000039, 10000000000037, 100000000000031, 1000000000000037, 10000000000000061, 100000000000000003, 1000000000000000003, 10000000000000000051
Offset: 1

Views

Author

Keywords

References

  • O'Hara, J. Rec. Math., 22 (1990), Table on page 278.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Maple
    a:= n-> nextprime(10^(n-1)):
    seq(a(n), n=1..20);  # Alois P. Heinz, Feb 11 2021
  • Mathematica
    Table[a := 10^n + 1; While[ ! PrimeQ[a], a++ ]; a, {n, 0, 30}] (* Stefan Steinerberger, Apr 08 2006 *)
    NextPrime/@(10^Range[0,20])  (* Harvey P. Dale, May 01 2011 *)
  • PARI
    a(n)=nextprime(10^(n-1)) \\ Charles R Greathouse IV, Jul 15 2011
    
  • Python
    from sympy import nextprime
    print([nextprime(10**(n-1)) for n in range(1, 21)]) # Michael S. Branicky, Feb 11 2021

Extensions

More terms from Stefan Steinerberger, Apr 08 2006