

A098812


Numbers n such that n^n + F(n) is prime, where F(k) is the kth Fibonacci number.


0




OFFSET

1,2


COMMENTS

a(5)>5000


LINKS



EXAMPLE

a(2)=2: 2^2+F(2) = 4+1 = 5, which is prime.


MATHEMATICA

Do[If[PrimeQ[n^n + Fibonacci[n]], Print[n]], {n, 5000}] (* Ryan Propper, May 20 2006 *)


CROSSREFS



KEYWORD

hard,nonn,more


AUTHOR



STATUS

approved



