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 A256498 #15 Apr 04 2015 18:28:55
%S A256498 11,15,25,31,36,37,42,45,48,75,149,156,160,182,268,444,581,1025,1125,
%T A256498 2504,6900,10924,11807,25262,26774,28739,29367,34902,43345,53878,
%U A256498 74473,107070,170300,178994
%N A256498 Indices of primes in the 9th-order Fibonacci number sequence, A127193.
%C A256498 a(35) > 2*10^5.
%H A256498 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 A256498 OEIS Wiki, <a href="https://oeis.org/wiki/Index_of_Fibonacci_Numbers_and_Variants">Index of Fibonacci Numbers and Variants</a>
%H A256498 OEIS Wiki, <a href="http://oeis.org/wiki/Index_to_OEIS:_Section_Fi">Index to OEIS Section Fi</a>
%t A256498 a={1,1,1,1,1,1,1,1,1}; step=9; lst={}; For[n=step+1,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
%Y A256498 Cf. A127193, A256499.
%K A256498 nonn,more
%O A256498 1,1
%A A256498 _Robert Price_, Mar 31 2015