The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066922 a(n) = gcd(Omega(n), omega(n)). 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 MATHEMATICA Table[GCD[PrimeOmega[n], PrimeNu[n]], {n, 110}] (* Harvey P. Dale, Dec 05 2015 *) PROG (PARI) { for (n=1, 1000, write("b066922.txt", n, " ", gcd(bigomega(n), omega(n))) ) } \\ Harry J. Smith, Apr 07 2010 CROSSREFS Cf. A001221 (omega), A001222 (Omega). Sequence in context: A327500 A351946 A351944 * A353835 A033183 A351742 Adjacent sequences: A066919 A066920 A066921 * A066923 A066924 A066925 KEYWORD nonn AUTHOR Benoit Cloitre, Jan 23 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 30 13:17 EDT 2023. Contains 363050 sequences. (Running on oeis4.)