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 A158014 #11 Oct 21 2021 11:09:37
%S A158014 17,41,89,137,233,569,809,857,1049,1097,1193,1433,1913,2153,2777,3209,
%T A158014 3449,3593,3833,3929,4073,4457,4793,4937,5273,5417,6089,6473,6569,
%U A158014 6857,7433,7529,7577,7817,9209,9497,9833
%N A158014 Primes p such that (p-1)/8 is also prime.
%H A158014 Vincenzo Librandi, <a href="/A158014/b158014.txt">Table of n, a(n) for n = 1..1000</a>
%F A158014 a(n)=8*A023228(n)+1. - _R. J. Mathar_, Mar 15 2009
%F A158014 a(n) >> n log^2 n. - _Charles R Greathouse IV_, Oct 21 2021
%t A158014 Flatten[Table[If[PrimeQ[n] && PrimeQ[(n - 1)/8], n, {}], {n, 1, 10000}]]
%t A158014 Select[Prime[Range[1500]], PrimeQ[(# - 1) / 8]&] (* _Vincenzo Librandi_, Apr 14 2013 *)
%o A158014 (PARI) list(lim)=my(v=List()); forprime(p=2,(lim-1)\8, if(isprime(8*p+1), listput(v,8*p+1))); Vec(v) \\ _Charles R Greathouse IV_, Oct 20 2021
%Y A158014 Cf. A005385 for (p-1)/2, A090866 for (p-1)/4, A051644 for (p-1)/6, A055781 for (p-1)/10.
%K A158014 nonn,easy
%O A158014 1,1
%A A158014 _Roger L. Bagula_, Mar 11 2009
%E A158014 Edited by the Associate Editors of the OEIS, Apr 22 2009