This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A118710 #8 Oct 02 2013 15:12:51
%S A118710 1,1,1,2,444
%N A118710 Smallest positive integer k such that k^k + F(n) is prime, where F(n) is the n-th Fibonacci number.
%C A118710 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.
%C A118710 a(6) = A087037(8) > 30300.
%F A118710 a(n) = A087037(A000045(n)).
%t A118710 Do[k = 1; While[ !PrimeQ[k^k + Fibonacci[n]], k++ ]; Print[k], {n, 32}]
%K A118710 hard,more,nonn
%O A118710 1,4
%A A118710 _Ryan Propper_, May 20 2006