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.

A006988 a(n) = (10^n)-th prime.

Original entry on oeis.org

2, 29, 541, 7919, 104729, 1299709, 15485863, 179424673, 2038074743, 22801763489, 252097800623, 2760727302517, 29996224275833, 323780508946331, 3475385758524527, 37124508045065437, 394906913903735329, 4185296581467695669, 44211790234832169331
Offset: 0

Views

Author

Keywords

Comments

Check the b-file for terms beyond those listed above.

Examples

			a(0) = 10^0-th prime = first prime = 2.
		

References

  • R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 111.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Cf. A099260, A274767 ((leading) digits of 103-digit a(100)).

Programs

Extensions

More terms from Paul Zimmermann
a(19) from Marc Deleglise, Jun 29 2008
a(20) found by Andrey V. Kulsha using a program by Xavier Gourdon, Oct 05 2011
a(21) from Henri Lifchitz, Sep 09 2014
a(22) from Henri Lifchitz, Nov 21 2014

A099261 Length in bits of (10^n)-th prime number.

Original entry on oeis.org

2, 5, 10, 13, 17, 21, 24, 28, 31, 35, 38, 42, 45, 49, 52, 56, 59, 62, 66, 69, 73, 76, 79, 83, 86, 89, 93, 96, 100, 103, 106, 110, 113, 116, 120, 123, 127, 130, 133, 137, 140, 143, 147, 150, 153, 157, 160, 163, 167, 170, 173, 177, 180, 184, 187, 190, 194, 197, 200, 204
Offset: 0

Views

Author

Rick L. Shepherd, Oct 11 2004

Keywords

Examples

			a(1) = 5 because A006988(1) = prime(10^1) = 29 = 11101 (base 2) has five bits.
		

Crossrefs

Cf. A006988 ((10^n)-th prime), A006880 (pi(10^n)), A007053 (pi(2^n)), A099260 (decimal digit lengths).

Programs

  • PARI
    a(n)=if(n<3,return([2,5,10][n+1]));my(l=n*log(10),ll=log(l),x=n*log(10)/log(2),lb=ceil(x+log(l+ll-1+(ll-2.2)/l)/log(2)),ub=ceil(x+log(l+ll-1+(ll-2)/l)/log(2)));if(lb==ub,lb,error("Cannot determine a("n")"))

Extensions

Extension, program, and reference from Charles R Greathouse IV, Aug 03 2010
Showing 1-2 of 2 results.