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 A066922 #23 May 07 2025 03:04:36
%S A066922 0,1,1,1,1,2,1,1,1,2,1,1,1,2,2,1,1,1,1,1,2,2,1,2,1,2,1,1,1,3,1,1,2,2,
%T A066922 2,2,1,2,2,2,1,3,1,1,1,2,1,1,1,1,2,1,1,2,2,2,2,2,1,1,1,2,1,1,2,3,1,1,
%U A066922 2,3,1,1,1,2,1,1,2,3,1,1,1,2,1,1,2,2,2,2,1,1,2,1,2,2,2,2,1,1,1,2,1,3,1,2,3
%N A066922 a(n) = gcd(Omega(n), omega(n)).
%H A066922 Harry J. Smith, <a href="/A066922/b066922.txt">Table of n, a(n) for n = 1..1000</a>
%F A066922 a(n) = A113901(n)/A066921(n). - _Amiram Eldar_, May 07 2025
%t A066922 Table[GCD[PrimeOmega[n],PrimeNu[n]],{n,110}] (* _Harvey P. Dale_, Dec 05 2015 *)
%o A066922 (PARI) a(n) = { gcd(bigomega(n),omega(n)) } \\ _Harry J. Smith_, Apr 07 2010
%Y A066922 Cf. A001221 (omega), A001222 (Omega), A066921, A113901.
%K A066922 nonn,easy
%O A066922 1,6
%A A066922 _Benoit Cloitre_, Jan 23 2002