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 A257227 #7 Dec 08 2017 17:38:10
%S A257227 11,361,373,2440,14002,68990
%N A257227 Indices of primes in the 10th-order Fibonacci number sequence, A122265.
%C A257227 a(7) > 2*10^5.
%H A257227 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 A257227 OEIS Wiki, <a href="https://oeis.org/wiki/Index_of_Fibonacci_Numbers_and_Variants">Index of Prime Fibonacci Numbers and Variants</a>
%H A257227 OEIS Wiki, <a href="http://oeis.org/wiki/Index_to_OEIS:_Section_Fi">Index to OEIS Section Fi</a>
%t A257227 a={0, 0, 0, 0, 0, 0, 0, 0, 0, 1}; step=10; lst={}; For[n=step,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
%t A257227 Flatten[Position[LinearRecurrence[{1,1,1,1,1,1,1,1,1,1},{0,0,0,0,0,0,0,0,0,1},69000],_?PrimeQ]]-1 (* _Harvey P. Dale_, Dec 08 2017 *)
%Y A257227 Cf. A122265, A257228.
%K A257227 nonn,more
%O A257227 1,1
%A A257227 _Robert Price_, Apr 18 2015