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 A144550 #10 Jun 23 2022 09:29:48
%S A144550 2,23,37,53,67,97,131,173,223,233,263,277,307,337,409,457,509,563,593,
%T A144550 613,631,653,797,853,877,1013,1039,1087,1129,1223,1259,1283,1297,1307,
%U A144550 1423,1447,1471,1601,1613,1663,1693,1709,1783,1867,1913,1993,2017,2069
%N A144550 Largest non-twin prime < n-th and (n+1)-th twin primes.
%H A144550 Harvey P. Dale, <a href="/A144550/b144550.txt">Table of n, a(n) for n = 1..1000</a>
%F A144550 {A007510(k): nextprime(A007510(k)) in A077800}. - _R. J. Mathar_, May 01 2010
%p A144550 isA077800 := proc(n) isprime(n) and ( isprime(n+2) or isprime(n-2)) ; end proc:
%p A144550 isA007510 := proc(n) isprime(n) and not isA077800(n) ; end proc:
%p A144550 isA144550 := proc(n) isA007510(n) and isA077800( nextprime(n)) ; end proc:
%p A144550 for n from 2 to 2500 do if isA144550(n) then printf("%d,",n) ; end if; end do: # _R. J. Mathar_, May 01 2010
%t A144550 Module[{nn=400,tps},tps=Union[Flatten[Select[Partition[Prime[Range[nn]],2,1], #[[2]]-#[[1]] == 2&]]];Complement[NextPrime[#,-1]&/@tps,tps]] (* _Harvey P. Dale_, Jun 23 2022 *)
%Y A144550 Cf. A077800, A088175.
%K A144550 nonn
%O A144550 1,1
%A A144550 _Juri-Stepan Gerasimov_, Dec 31 2008
%E A144550 Corrected (1993 inserted) by _R. J. Mathar_, May 01 2010