Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118910
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118910 a(1) = 2; a(n) is greatest prime < a(n-1)^3. +0
3
2, 7, 337, 38272739, 56062005704198360319209, 176199995814327287356671209104585864397055039072110696028654438846269 (list; graph; listen)
OFFSET

1,1

COMMENT

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 this_sequence A081505 A110386 A027732

Adjacent sequences: A118907 A118908 A118909 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research