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 A255529 #7 Mar 10 2015 01:42:51
%S A255529 10,19,878
%N A255529 Indices of primes in the 9th-order Fibonacci number sequence, A104144.
%C A255529 a(4) > 2*10^5.
%H A255529 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 A255529 a={0,0,0,0,0,0,0,0,1}; step=9; lst={}; For[n=step,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
%o A255529 (PARI) a104144(n) = polcoeff(x^8/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9) + O(x^(n+1)), n);
%o A255529 lista(nn) = {for (n=1, nn, if (isprime(a104144(n)), print1(n, ", ")););} \\ _Michel Marcus_, Feb 27 2015
%Y A255529 Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A104144.
%K A255529 nonn,more
%O A255529 1,1
%A A255529 _Robert Price_, Feb 24 2015