This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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, 2, 444 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS 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) = A087037(8) > 30300. LINKS FORMULA a(n) = A087037(A000045(n)). MATHEMATICA Do[k = 1; While[ !PrimeQ[k^k + Fibonacci[n]], k++ ]; Print[k], {n, 32}] CROSSREFS Sequence in context: A119120 A109931 A200951 * A159513 A012730 A012734 Adjacent sequences:  A118707 A118708 A118709 * A118711 A118712 A118713 KEYWORD hard,more,nonn AUTHOR Ryan Propper, May 20 2006 STATUS approved

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

Last modified October 20 15:44 EDT 2018. Contains 316389 sequences. (Running on oeis4.)