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 A257073 #12 Nov 11 2024 14:01:56
%S A257073 12,13,14,17,18,27,28,29,32,50,73,75,76,81,105,184,213,813,896,1553,
%T A257073 4132,5661,5787,7896,8726,9225,9345,11332,11391,12627,13163,14173,
%U A257073 15900,17772,17827,20847,21034,25607,94510,98297,101251,127488,138108,188706
%N A257073 Indices of primes in the 10th-order Fibonacci number sequence, A127194.
%C A257073 a(45) > 2*10^5.
%H A257073 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 A257073 OEIS Wiki, <a href="https://oeis.org/wiki/Index_of_Fibonacci_Numbers_and_Variants">Index of Prime Fibonacci Numbers and Variants</a>
%H A257073 OEIS Wiki, <a href="http://oeis.org/wiki/Index_to_OEIS:_Section_Fi">Index to OEIS Section Fi</a>
%t A257073 a={1,1,1,1,1,1,1,1,1,1}; step=10; lst={}; For[n=step+1,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
%t A257073 Position[With[{c=Table[1,{10}]},LinearRecurrence[c,c,1000]],_?PrimeQ]//Flatten (* The program generates the first 27 terms of the sequence. *) (* _Harvey P. Dale_, Nov 11 2024 *)
%Y A257073 Cf. A127194, A257074.
%K A257073 nonn
%O A257073 1,1
%A A257073 _Robert Price_, Apr 15 2015