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 A257074 #7 Jan 17 2024 14:41:15
%S A257074 19,37,73,577,1153,588097,1175617,2350081,18772993,4877942342401,
%T A257074 40459828019985257473,161680527238968327169,323202386497090728961,
%U A257074 10317126837306838775329,171065716870341976441855042753
%N A257074 Primes in the 10th-order Fibonacci numbers A127194.
%C A257074 a(16) is too large to display here. It has 53 digits and is the 184th term in A127194.
%H A257074 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 A257074 OEIS Wiki, <a href="https://oeis.org/wiki/Index_of_Fibonacci_Numbers_and_Variants">Index of Prime Fibonacci Numbers and Variants</a>
%H A257074 OEIS Wiki, <a href="http://oeis.org/wiki/Index_to_OEIS:_Section_Fi">Index to OEIS Section Fi</a>
%t A257074 a={1,1,1,1,1,1,1,1,1,1}; step=10; 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
%t A257074 Select[With[{t=Table[1,{10}]},LinearRecurrence[t,t,400]],PrimeQ] (* _Harvey P. Dale_, Jan 17 2024 *)
%Y A257074 Cf. A127194, A257073.
%K A257074 nonn
%O A257074 1,1
%A A257074 _Robert Price_, Apr 15 2015