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 A089629 #10 Jun 25 2021 23:34:28
%S A089629 17,29,59,227,269,617,1031,1277,1289,1301,1607,1667,1697,2087,2129,
%T A089629 2309,2711,2789,3257,3527,3539,3557,3917,4019,4241,4517,4637,4787,
%U A089629 5477,5501,5639,6551,7307,8819,8837,8999,9011,10037,10067,10271,10499,12041,13679
%N A089629 Smallest member of a pair of consecutive twin prime pairs that have one prime between them.
%C A089629 Run the PARI script savetwins(100000) or so to build the twinprime array of lower bounds before you run the main script.
%H A089629 Amiram Eldar, <a href="/A089629/b089629.txt">Table of n, a(n) for n = 1..10000</a>
%e A089629 Twin prime pairs 17,19 and 29,31 have only the prime 23 between them.
%o A089629 (PARI) pbetweentw(n,p) = \p is the number of primes between { forstep(x1=1,n,1, c=0; t1 = twin[x1]; t2 = twin[x1+1]; for(y=t1+4,t2-1, if(isprime(y),c++) ); if(c==p,print1(t1",")) ) } \ build a twin prime table of lower bounds savetwins(n) = { twin = vector(n); c=1; forprime(x=3,n*10, if(isprime(x+2), twin[c]=x; c++; ) ) }
%K A089629 easy,nonn
%O A089629 1,1
%A A089629 _Cino Hilliard_, Jan 01 2004
%E A089629 Offset corrected by _Amiram Eldar_, Dec 28 2019