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.

A073123 a(n) is the largest number such that pi(a(n)) = prime(n).

Original entry on oeis.org

4, 6, 12, 18, 36, 42, 60, 70, 88, 112, 130, 162, 180, 192, 222, 250, 280, 292, 336, 358, 372, 408, 432, 462, 520, 556, 568, 592, 600, 618, 718, 742, 786, 808, 862, 880, 928, 970, 996, 1032, 1068, 1090, 1162, 1180, 1212, 1222, 1300, 1422, 1438, 1450, 1480
Offset: 1

Views

Author

Labos Elemer, Jul 16 2002

Keywords

Comments

Primes with prime subscripts correspond to least numbers m, such that pi(m) = prime(n).

Examples

			n=25: prime(25)=97; for 12 terms X = {509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520}, pi(X)=97. Largest is a(25)=520, smallest is A006450(25), number of terms = A073124(25).
		

Crossrefs

Equals A072677(n) - 1.

Programs

  • Maple
    seq(ithprime(ithprime(n)+1)-1, n=1..100); # Robert Israel, May 14 2018

Formula

a(n) = Max{x: A000720(x)=A000040(n)}.
a(n) = A000040(A000040(n)+1) - 1.

Extensions

Edited by Robert Israel, May 14 2018