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 A256499 #14 Apr 09 2015 05:28:06
%S A256499 17,257,260609,16580657,527972353,1054904321,33590968001,267934222337,
%T A256499 2137144350721,279308966066204560897,
%U A256499 4904838477959792746889087209953222309396481,623502124433801536413569315448615191583313921,9936775914719167257001281976859570231260282873
%N A256499 Primes in the 9th-order Fibonacci numbers A127193.
%C A256499 a(14) is too large to display here. It has 53 digits and is the 182nd term in A127193.
%H A256499 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 A256499 OEIS Wiki, <a href="https://oeis.org/wiki/Index_of_Fibonacci_Numbers_and_Variants">Index of Prime Fibonacci Numbers and Variants</a>
%H A256499 OEIS Wiki, <a href="http://oeis.org/wiki/Index_to_OEIS:_Section_Fi">Index to OEIS Section Fi</a>
%t A256499 a={1,1,1,1,1,1,1,1,1}; step=9; 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 A256499 Cf. A127193, A256498.
%K A256499 nonn
%O A256499 1,1
%A A256499 _Robert Price_, Mar 31 2015