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 A253705 #17 Apr 26 2018 12:06:47
%S A253705 9,17,25,125,350,1322,108935,199528
%N A253705 Indices of primes in the 8th-order Fibonacci number sequence, A079262.
%C A253705 a(9) > 2*10^5.
%H A253705 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
%t A253705 a={0,0,0,0,0,0,0,1}; step=8; lst={}; For[n=step,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
%t A253705 Flatten[Position[LinearRecurrence[{1,1,1,1,1,1,1,1},{0,0,0,0,0,0,0,1},200000],_?PrimeQ]]-1 (* The program takes a long time to run *) (* _Harvey P. Dale_, Apr 26 2018 *)
%o A253705 (PARI) lista(nn) = {gf = x^7/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8); for (n=0, nn, if (isprime(polcoeff(gf+O(x^(n+1)), n)), print1(n, ", ")););} \\ _Michel Marcus_, Jan 12 2015
%Y A253705 Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262.
%K A253705 nonn,more
%O A253705 1,1
%A A253705 _Robert Price_, Jan 09 2015