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-1 of 1 results.

A199124 Least prime having 1 more digit and higher sum of digits than the preceding term.

Original entry on oeis.org

2, 13, 107, 1009, 10037, 100049, 1000099, 10000379, 100000399, 1000000787, 10000000799, 100000001989, 1000000001999, 10000000003999, 100000000006997, 1000000000017899, 10000000000018999, 100000000000038989, 1000000000000067999, 10000000000000079899, 100000000000000079999
Offset: 1

Views

Author

M. F. Hasler, Nov 03 2011

Keywords

Comments

For more terms use the formula a(n)=10^(n-1)+A199190(n) and the values listed in A199190.

Crossrefs

Cf. A065122.

Programs

  • PARI
    {print1(p=2);for(d=1,20,o=A007953(p);p=10^d; until(A007953(p=nextprime(p+1))>o,);print1(","p))}

Formula

A199124(n) = 10^(n-1)+A199190(n); see there for an estimate of growth.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.