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

 

Logo
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
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: A351946 A351944 A366918 * A371244 A353835 A033183
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 22:08 EDT 2024. Contains 375284 sequences. (Running on oeis4.)