Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118912
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118912 a(1) = 2; a(n) is greatest prime < a(n-1)^4. +0
1
2, 13, 28559, 665230244078823349, 195833931687186822327230545227550596864953022841534058316595001440791433 (list; graph; listen)
OFFSET

1,1

COMMENT

Exponent 4 analogue of A059785 a(n+1)=prevprime(a(n)^2), with exponent 3 being A118910 a(1) = 2; a(n) is greatest prime < a(n-1)^3.

FORMULA

a(1) = 2; a(n) is greatest prime < a(n-1)^4.

EXAMPLE

a(1) = 2, by definition.

a(2) = 13 = 2^4 - 3.

a(3) = 28559 = 13^4 - 2.

a(4) = 665230244078823349 = 28559^4 - 12.

a(5) = 195833931687186822327230545227550596864953022841534058316595001440791433 = 665230244078823349^4 - 168.

a(6) is too large to include.

CROSSREFS

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

Sequence in context: A110820 A139519 A111016 this_sequence A135970 A027738 A133420

Adjacent sequences: A118909 A118910 A118911 this_sequence A118913 A118914 A118915

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.003 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research