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 A135957 #4 Mar 31 2012 10:22:06 %S A135957 1,2,8,12,25,50,96,73,164 %N A135957 a(n) = smallest k such that Fibonacci(prime(k)) has exactly n prime factors. %Y A135957 A135958 gives prime(k). Cf. A000045, A001605, A050937, A075737, A134787, A134852. %K A135957 nonn,hard,less %O A135957 0,2 %A A135957 _Artur Jasinski_, Dec 08 2007 %E A135957 Edited and extended by _David Wasserman_, Mar 26 2008