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 A077129 #10 Apr 06 2023 10:39:01
%S A077129 3,5,7,5,11,5,13,11,7,13,7,5,7,11,13,7,17,11,5,17,7,13,11,13,5,11,5,
%T A077129 13,37,7,13,5,17,7,23,11,7,11,13,7,29,5,11,5,31,19,11,5,13,11,7,17,13,
%U A077129 11,13,7,19,11,5,23,29,13,5,11,31,11,29,5,17,11,17,11,19,7,13,19,11
%N A077129 Smallest number which is relatively prime to all the numbers between successive odd primes.
%C A077129 Naturally every member is a prime.
%H A077129 Harvey P. Dale, <a href="/A077129/b077129.txt">Table of n, a(n) for n = 0..1000</a>
%e A077129 a(5)= 11,is the smallest number coprime to all the numbers from 13 to 17 i.e. 14,15 and 16.
%t A077129 sncp[n_]:=Module[{cr=Range[Prime[n]+1,Prime[n+1]-1],k=3},While[Total[Boole[CoprimeQ[ cr,k]]]!= Length[cr],k=NextPrime[k]];k]; Array[sncp,80,2] (* _Harvey P. Dale_, Apr 06 2023 *)
%o A077129 (PARI) for(n=2,100, for(i=2,10^9,f=0:for(k=prime(n)+1,nextprime(prime(n)+1)-1,if(gcd(i,k)>1,f=1:break)): if(!f,print1(i","):break)))
%K A077129 nonn
%O A077129 0,1
%A A077129 _Amarnath Murthy_, Oct 29 2002
%E A077129 More terms from _Ralf Stephan_, Mar 27 2003