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 A257967 #14 May 16 2015 16:30:05
%S A257967 11,41,641,10462721,20920321,10917370260001,364090824435675874561,
%T A257967 3037065045777476472194281921,97067184407836614348142428161,
%U A257967 3237159714751144204638073829896089601,26434543100644872259207947255028288307201,3600373169282616313621210190325730096037120382894091
%N A257967 Primes in the 11th-order Fibonacci numbers A127624.
%C A257967 a(13) is too large to display here. It has 61 digits and is the 210th term in A127624.
%H A257967 Tony D. Noe and Jonathan Vos Post, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL8/Noe/noe5.html">Primes in Fibonacci n-step and Lucas n-step Sequences</a>, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4.
%H A257967 OEIS Wiki, <a href="https://oeis.org/wiki/Index_of_Fibonacci_Numbers_and_Variants">Index of Prime Fibonacci Numbers and Variants</a>
%t A257967 a={1,1,1,1,1,1,1,1,1,1,1}; step=11; offset=1; lst={}; For[n=step+offset,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,sum]]; a=RotateLeft[a]; a[[step]]=sum]; lst
%Y A257967 Cf. A127624, A257966.
%K A257967 nonn
%O A257967 1,1
%A A257967 _Robert Price_, May 14 2015