login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118910 a(1) = 2; a(n) is greatest prime < a(n-1)^3. 2
2, 7, 337, 38272739, 56062005704198360319209, 176199995814327287356671209104585864397055039072110696028654438846269 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Exponent 3 analogue of A059785 a(n+1)=prevprime(a(n)^2), with a(1) = 2. Obverse of this is A051254.

EXAMPLE

a(5) = 62343227157465615355481 = a(4)^3 - 32 = 39651817^3 - 32 and there is no k < 32 such that 39651817^3 - k is prime.

MATHEMATICA

a=2; Join[{2}, Table[a=a^3; While[ !PrimeQ[a], a=a-1]; a, {5}]] - T. D. Noe (noe(AT)sspectra.com), Nov 15 2006

CROSSREFS

Cf. A001358, A055496, A076656, A006992, A005384, A005385, A118908-A118913.

Sequence in context: A128466 A048122 A144787 * A081505 A176748 A110386

Adjacent sequences:  A118907 A118908 A118909 * A118911 A118912 A118913

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), May 05 2006

EXTENSIONS

Corrected by T. D. Noe (noe(AT)sspectra.com), Nov 15 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.