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 A240593 #12 Apr 12 2020 18:15:44
%S A240593 14,21,33,34,38,55,57,62,65,69,74,77,85,86,91,93,94,105,110,114,115,
%T A240593 118,119,122,129,133,141,142,143,145,154,158,159,165,174,177,182,183,
%U A240593 185,186,187,194,201,202,203,205,206,209,213,214,215,217,218,219,221,230,235,237,246,247,253,254,258,259,265,266,273,285,286,287,290,295,298,299
%N A240593 The smaller of a pair of consecutive composite squarefree numbers (A120944) without any prime number between them.
%C A240593 Supersequence of A121495.
%e A240593 62 is in the sequence because A120944(20)=62, A120944(21)=65, without primes between them.
%t A240593 Select[Partition[Select[Range[400],CompositeQ[#]&&SquareFreeQ[#]&],2,1], PrimePi[ #[[1]]]==PrimePi[#[[2]]]&][[All,1]] (* _Harvey P. Dale_, Apr 12 2020 *)
%o A240593 (PARI)
%o A240593 freesqrcomp(n)=issquarefree(n)&&!isprime(n)
%o A240593 nextfqc(n)={local(k); k=n+1; while(!freesqrcomp(k), k+=1); return(k)}
%o A240593 {for(i=2, 1000, if(freesqrcomp(i) && (nextfqc(i)<nextprime(i)), print1(i,", ")))}
%Y A240593 Cf. A120944, A240592.
%K A240593 nonn
%O A240593 1,1
%A A240593 _Antonio Roldán_, Apr 08 2014