A054270 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A054270

Largest prime below prime(n)^2 (A001248).

3, 7, 23, 47, 113, 167, 283, 359, 523, 839, 953, 1367, 1669, 1847, 2207, 2803, 3469, 3719, 4483, 5039, 5323, 6229, 6883, 7919, 9403, 10193, 10607, 11447, 11867, 12763, 16127, 17159, 18757, 19319, 22193, 22787, 24631, 26561, 27883, 29927, 32029

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

For n > 1, the n-1 first primes determine the primes up to a(n). This is how the Sieve of Eratosthenes works. - Jean-Christophe Hervé, Oct 21 2013

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = Max[prime q: q < prime(n)^2].

a(n) = prime(A000879(n)) = A000040(A000879(n)). - Jean-Christophe Hervé, Oct 21 2013

MAPLE

seq(prevprime(ithprime(i)^2), i=1..100); # Robert Israel, May 04 2020