A066922 a(n) = gcd(Omega(n), omega(n)).

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, 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, 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

Offset

1,6

Links

Harry J. Smith, Table of n, a(n) for n = 1..1000

Formula

a(n) = A113901(n)/A066921(n). - Amiram Eldar, May 07 2025

Mathematica

Table[GCD[PrimeOmega[n], PrimeNu[n]], {n, 110}] (* Harvey P. Dale, Dec 05 2015 *)

Prog

(PARI) a(n) = { gcd(bigomega(n), omega(n)) } \\ Harry J. Smith, Apr 07 2010

Crossrefs

Cf. A001221 (omega), A001222 (Omega), A066921, A113901.

Sequence in context: A351946 A351944 A366918 * A395744 A371244 A353835

Adjacent sequences: A066919 A066920 A066921 * A066923 A066924 A066925

Keyword

nonn,easy

Author

Benoit Cloitre, Jan 23 2002

Status

approved