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 A257228 #4 Apr 19 2015 01:03:05
%S A257228 2,
%T A257228 3876345660966505581780035851822613413637045687942554538584103751904155528656612320450718024564637501177857,
%U A257228 15784273697726525594915158437704910106795669967932151790483411869827615323130147795459165734845011296559523773
%N A257228 Primes in the 10th-order Fibonacci numbers A122265.
%C A257228 a(4) is too large to display here. It has 731 digits and is the 2440th term in A122265.
%H A257228 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 A257228 OEIS Wiki, <a href="https://oeis.org/wiki/Index_of_Fibonacci_Numbers_and_Variants">Index of Prime Fibonacci Numbers and Variants</a>
%H A257228 OEIS Wiki, <a href="http://oeis.org/wiki/Index_to_OEIS:_Section_Fi">Index to OEIS Section Fi</a>
%t A257228 a={0, 0, 0, 0, 0, 0, 0, 0, 0, 1}; step=10; offset=0; 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 A257228 Cf. A122265, A257227.
%K A257228 nonn
%O A257228 1,1
%A A257228 _Robert Price_, Apr 18 2015