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 A189982 #28 Mar 29 2025 15:36:47
%S A189982 420,630,660,780,924,990,1020,1050,1092,1140,1170,1380,1386,1428,1470,
%T A189982 1530,1540,1596,1638,1650,1710,1716,1740,1820,1860,1932,1950,2070,
%U A189982 2142,2220,2244,2380,2394,2436,2460,2508,2550,2574,2580,2604,2610,2652,2660,2790
%N A189982 Numbers with prime signature (2,1,1,1), i.e., factorization p*q*r*s^2 with distinct primes p, q, r, s.
%C A189982 Theorem 4 in Goldston-Graham-Pintz-Yildirim proves that a(n+1) = a(n) + 1 for infinitely many n. - _Charles R Greathouse IV_, Jul 17 2015, corrected by _M. F. Hasler_, Jul 17 2019
%H A189982 T. D. Noe, <a href="/A189982/b189982.txt">Table of n, a(n) for n = 1..1000</a>
%H A189982 D. A. Goldston, S. W. Graham, J. Pintz, and C. Y. Yıldırım, <a href="http://arxiv.org/abs/0803.2636">Small gaps between almost primes, the parity problem, and some conjectures of Erdos on consecutive integers</a> (2008)
%H A189982 Will Nicholes, <a href="https://willnicholes.com/2010/06/06/list-of-prime-signatures/">List of Prime Signatures</a>
%H A189982 <a href="/index/Pri#prime_signature">Index to sequences related to prime signature</a>
%t A189982 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,1,1,2}; Select[Range[4000],f]
%o A189982 (PARI) is(n)=vecsort(factor(n)[,2])==[1, 1, 1, 2]~ \\ _Charles R Greathouse IV_, Jul 17 2015
%Y A189982 Part of the list A178739 .. A179696 and A030514 .. A030629, A189975 .. A189990 etc., cf. A101296.
%K A189982 nonn
%O A189982 1,1
%A A189982 _Vladimir Joseph Stephan Orlovsky_, May 03 2011
%E A189982 Definition reworded by _M. F. Hasler_, Jul 17 2019