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 A178032 #21 Feb 20 2023 06:13:56
%S A178032 603,2523,4203,4923,7442,10467,18027,20402,54475,58923,79011,97675,
%T A178032 104211,118323,120787,122571,124891,132723,134307,148075,200491,
%U A178032 229707,243602,246571,249307,258507,303651,324331,331387,370827,385675
%N A178032 Numbers n such that n, n+1, n+2 are all of the form p*q^2 for distinct primes p,q.
%H A178032 Ray Chandler, <a href="/A178032/b178032.txt">Table of n, a(n) for n = 1..10000</a> (first 500 terms from Harvey P. Dale)
%H A178032 <a href="/index/Pri#prime_signature">Index to sequences related to prime signature</a>
%e A178032 603=3*3*67, 604=2*2*151, 605=5*11*11
%e A178032 2523=3*29*29, 2524=2*2*631, 2525=5*5*101
%t A178032 SequencePosition[Table[If[Sort[FactorInteger[n][[All,2]]]=={1,2},1,0],{n,400000}],{1,1,1}][[All,1]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Mar 30 2019 *)
%o A178032 (Sage) is_A178032 = lambda n: all(sorted(m for p,m in factor(k)) == [1, 2] for k in (n, n+1, n+2)) # _D. S. McNeil_, Dec 17 2010
%Y A178032 Cf. A054753, A074172, A308683, A141621.
%K A178032 nonn
%O A178032 1,1
%A A178032 _John L. Drost_, Dec 16 2010
%E A178032 Corrected and extended by _D. S. McNeil_, Dec 16 2010