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 A006073 #29 Jun 12 2024 18:49:44
%S A006073 2,3,7,20,33,34,38,44,50,54,55,56,74,75,85,86,91,92,93,94,98,115,116,
%T A006073 117,122,133,134,141,142,143,144,145,146,158,159,160,175,176,183,187,
%U A006073 200,201,205,206,207,212,213,214,215,216,217,224,235,247
%N A006073 Numbers k such that k, k+1 and k+2 all have the same number of distinct prime divisors.
%C A006073 Distinct prime divisors means that the prime divisors are counted without multiplicity. - _Harvey P. Dale_, Apr 19 2011
%H A006073 Harvey P. Dale, <a href="/A006073/b006073.txt">Table of n, a(n) for n = 1..10000</a>
%F A006073 Union of {2,3,7} and A364307 and A364308 and A364309 and A364266 and A364265 etc. - _R. J. Mathar_, Jul 18 2023
%t A006073 pdQ[n_]:=PrimeNu[n]==PrimeNu[n+1]==PrimeNu[n+2]; Select[Range[250], pdQ] (* _Harvey P. Dale_, Apr 19 2011 *)
%t A006073 Take[Transpose[Flatten[Select[Partition[{#,PrimeNu[#]}&/@Range[250000], 3,1],#[[1,2]]==#[[2,2]]==#[[3,2]]&],1]][[1]],{1,-1,3}] (* _Harvey P. Dale_, Dec 09 2011 *)
%t A006073 Flatten[Position[Partition[PrimeNu[Range[250]],3,1],_?(#[[1]]==#[[2]]== #[[3]]&),{1},Heads->False]] (* _Harvey P. Dale_, Oct 30 2013 *)
%t A006073 SequencePosition[PrimeNu[Range[250]],{x_,x_,x_}][[;;,1]] (* _Harvey P. Dale_, Jun 12 2024 *)
%Y A006073 Cf. A001221, A006049, A045932.
%K A006073 nonn
%O A006073 1,1
%A A006073 _N. J. A. Sloane_