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 A175443 #14 Jan 02 2017 17:32:25
%S A175443 2,3,7,13,17,23,37,43,47,53,67,73,97,103,107,113,127,163,167,173,197,
%T A175443 223,227,233,257,263,277,283,307,313,317,353,367,373,397,433,457,463,
%U A175443 467,503,547,563,577,593,607,613,617,643,647,653,677,683,727,733,757
%N A175443 a(1)=2, a(n+1) = smallest prime > a(n) such that a(n+1)+a(n) is multiple of 5.
%C A175443 Lexicographically first subsequence of primes such that the sum of any two adjacent terms is a multiple of 5. - _Charles R Greathouse IV_, Apr 13 2015
%C A175443 For n >= 1, a(2*n) == 3 (mod 10) and a(2*n+1) == 7 (mod 10). - _Robert Israel_, Apr 13 2015
%H A175443 Charles R Greathouse IV, <a href="/A175443/b175443.txt">Table of n, a(n) for n = 1..10000</a>
%p A175443 a[1]:= 2: a[2]:= 3:
%p A175443 for n from 2 to 99 do
%p A175443 for t from a[n]+ (-2*a[n] mod 10) by 10 while not isprime(t) do od:
%p A175443 a[n+1]:= t;
%p A175443 od:
%p A175443 seq(a[n],n=1..100); # _Robert Israel_, Apr 13 2015
%t A175443 spm5[n_]:=Module[{p=NextPrime[n]},While[!Divisible[n+p,5],p = NextPrime[ p]]; p]; NestList[spm5,2,60] (* _Harvey P. Dale_, Jan 02 2017 *)
%o A175443 (PARI) list(lim)=my(v=List([2])); forprime(p=2,lim,if((v[#v]+p)%5,, listput(v,p))); Vec(v) \\ _Charles R Greathouse IV_, Apr 13 2015
%Y A175443 Cf. A175451.
%K A175443 nonn,easy
%O A175443 1,1
%A A175443 _Zak Seidov_, May 28 2010