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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077037 Largest prime < n^3. 8
7, 23, 61, 113, 211, 337, 509, 727, 997, 1327, 1723, 2179, 2741, 3373, 4093, 4909, 5827, 6857, 7993, 9257, 10639, 12163, 13807, 15619, 17573, 19681, 21943, 24379, 26993, 29789, 32749, 35933, 39301, 42863, 46649, 50651, 54869, 59281, 63997 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
LINKS
FORMULA
a(n) > (n-1)^3 for all large n, by Ingham's theorem (see A060199). - Jonathan Sondow, Mar 27 2014
MATHEMATICA
PrimePrev[n_]:=Module[{k}, k=n-1; While[ !PrimeQ[k], k-- ]; k]; f[n_]:=n^3; lst={}; Do[AppendTo[lst, PrimePrev[f[n]]], {n, 5!}]; lst (* Vladimir Joseph Stephan Orlovsky, Feb 25 2010 *)
Table[NextPrime[n^3, -1], {n, 2, 40}] (* Robert G. Wilson v, Aug 17 2010 *)
PROG
(Python)
from sympy import prevprime
def a(n): return prevprime(n**3)
print([a(n) for n in range(2, 41)]) # Michael S. Branicky, Jul 23 2021
(PARI) a(n) = precprime(n^3); \\ Michel Marcus, Jan 14 2023
CROSSREFS
Sequence in context: A140096 A096345 A211644 * A201110 A333187 A220509
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 21 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)