%I A098812
%S A098812 1,2,3,28
%N A098812 Numbers n such that n^n + F(n) is prime, where F(k) is the k-th Fibonacci 
               number.
%C A098812 a(5)>5000
%e A098812 a(2)=2: 2^2+F(2) = 4+1 = 5, which is prime.
%t A098812 Do[If[PrimeQ[n^n + Fibonacci[n]], Print[n]], {n, 5000}] - Ryan Propper 
               (rpropper(AT)stanford.edu), May 20 2006
%Y A098812 Sequence in context: A126655 A132533 A059089 this_sequence A037320 A010344 
               A037316
%Y A098812 Adjacent sequences: A098809 A098810 A098811 this_sequence A098813 A098814 
               A098815
%K A098812 hard,nonn,more
%O A098812 1,2
%A A098812 Ray G. Opao (1260(AT)email.com), Oct 07 2004