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 A066312 #23 Jun 02 2023 01:59:22
%S A066312 6,12,15,18,24,30,35,36,45,48,54,60,72,75,77,90,96,105,108,120,135,
%T A066312 143,144,150,162,175,180,192,210,216,221,225,240,245,270,288,300,315,
%U A066312 323,324,360,375,384,385,405,420,432,437,450,480,486
%N A066312 Numbers, other than prime powers, whose distinct prime factors are consecutive primes.
%C A066312 Numbers whose squarefree kernel (A007947) is the product of 2 or more consecutive primes. - _Peter Munn_, May 27 2023
%H A066312 Harry J. Smith, <a href="/A066312/b066312.txt">Table of n, a(n) for n=1..1000</a>
%F A066312 {a(n) : n >= 1} = {k >= 1 : A007947(k) is in A097889}. - _Peter Munn_, May 29 2023
%e A066312 75 is included because 75 = 3 * 5^2 and 3 and 5 are consecutive primes.
%t A066312 Select[Range[2, 500], And[! PrimePowerQ@ #, Union@ Differences@ PrimePi[FactorInteger[#][[All, 1]]] == {1}] &] (* _Michael De Vlieger_, Sep 24 2017 *)
%o A066312 (PARI) { n=0; for (m=2, 10^9, f=factor(m); b=1; if (matsize(f)[1] == 1, next); for (i=2, matsize(f)[1], if (primepi(f[i, 1]) - primepi(f[i - 1, 1]) > 1, b=0; break)); if (b, write("b066312.txt", n++, " ", m); if (n==1000, return)) ) } \\ _Harry J. Smith_, Feb 10 2010
%Y A066312 Cf. A007947, A097889.
%K A066312 nonn
%O A066312 1,1
%A A066312 _Leroy Quet_, Jan 01 2002
%E A066312 OFFSET changed from 0,1 to 1,1 by _Harry J. Smith_, Feb 10 2010
%E A066312 Name edited by _Peter Munn_, May 29 2023