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 A135958 #7 Nov 08 2013 08:46:23
%S A135958 2,3,19,37,97,229,503,367,971
%N A135958 a(n) = smallest prime p such that Fibonacci(p) has exactly n prime factors.
%F A135958 a(n) = prime(A135957(n)).
%o A135958 (PARI) a(n) = {p = 2; while (omega(fibonacci(p)) != n, p = nextprime(p+1)); p;} \\ _Michel Marcus_, Nov 08 2013
%Y A135958 A135959 gives the Fibonacci numbers. Cf. A000045, A050937, A075737, A090819, A135957.
%K A135958 nonn,hard,less
%O A135958 0,1
%A A135958 _Artur Jasinski_, Dec 08 2007
%E A135958 Edited and extended by _David Wasserman_, Mar 26 2008