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 A257966 #10 Jul 13 2025 12:49:12
%S A257966 12,14,18,32,33,52,77,100,105,130,143,180,210,226,357,377,472,548,989,
%T A257966 1129,1174,1421,1722,4769,6544,6879,7893,18888,21061,24419,25884,
%U A257966 32675,53776,62186,109848,110989,123527,160462
%N A257966 Indices of primes in the 11th-order Fibonacci number sequence, A127624.
%C A257966 a(39) > 2*10^5.
%H A257966 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 A257966 OEIS Wiki, <a href="https://oeis.org/wiki/Index_of_Fibonacci_Numbers_and_Variants">Index of Prime Fibonacci Numbers and Variants</a>
%t A257966 a={1,1,1,1,1,1,1,1,1,1,1}; step=11; 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 A257966 With[{c=PadRight[{},11,1]},Position[LinearRecurrence[c,c,1800],_?PrimeQ]]//Flatten (* The program generates the first 23 terms of the sequence. *) (* _Harvey P. Dale_, Jul 13 2025 *)
%Y A257966 Cf. A127624, A257967.
%K A257966 nonn
%O A257966 1,1
%A A257966 _Robert Price_, May 14 2015