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 A057324 #20 Jul 08 2019 11:50:44 %S A057324 2,3,11,13,53,131,233,241,281,569,659,691,761,881,1693,2063,2411,2521, %T A057324 2551,2663,2729,2741,2861,3089,4021,4159,4201,4243,4423,4793,6091, %U A057324 7103,7229,7369,7753,7829,8053,8641,8669,9041,9059,9539,9649,9769,10513 %N A057324 First member of a prime triple in a p^2 + p - 1 progression. %C A057324 There exist no such triples of the form p^2 + p + 1 because each third member is always divisible by 3. %C A057324 Subsequence of A053184. - _Pierre CAMI_, Sep 13 2013 %H A057324 Pierre CAMI, <a href="/A057324/b057324.txt">Table of n, a(n) for n = 1..10000</a> %H A057324 <a href="/index/Pri#primes_AP">Index entries for sequences related to primes in arithmetic progressions</a> %e A057324 2 -> 2^2+2-1 = 5 -> 5^2+5-1 = 29 hence the prime triple (2,5,29). %t A057324 fmpQ[n_]:=AllTrue[NestList[#^2+#-1&,n,2],PrimeQ]; Select[Prime[Range[ 1300]],fmpQ] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Jul 08 2019 *) %o A057324 (PARI) is(n)=for(k=1,3,if(!isprime(n),return(0));n=n^2+n-1);1 \\ _Charles R Greathouse IV_, Sep 13 2013 %Y A057324 Cf. A053184, A053185, A057325. %K A057324 nonn %O A057324 1,1 %A A057324 _Patrick De Geest_, Aug 15 2000