Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118710
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118710 Smallest positive integer k such that k^k + F(n) is prime, where F(n) is the n-th Fibonacci number. +0
1
1, 1, 1, 2, 444 (list; graph; listen)
OFFSET

1,4

COMMENT

Next term is not known. Sequence continues: 1, 1, 1, 2, 444, ?, 2, 4, 3, 2, ?, ?, 6, ?, 1059, 2, 2, ?, ?, 14, 3, 66, 2, ?, 2, 46, 15, 8, 78, 273, 2, 2. All unknown terms are >= 2000. All known terms except a(15) = 1059 correspond to certified primes.

a(6) > 10000. - Hans Havermann (pxp(AT)rogers.com), May 31 2006

MATHEMATICA

Do[k = 1; While[ !PrimeQ[k^k + Fibonacci[n]], k++ ]; Print[k], {n, 32}]

CROSSREFS

Sequence in context: A154541 A119120 A109931 this_sequence A159513 A012730 A012734

Adjacent sequences: A118707 A118708 A118709 this_sequence A118711 A118712 A118713

KEYWORD

hard,more,nonn

AUTHOR

Ryan Propper (rpropper(AT)stanford.edu), May 20 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 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research