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

%I #14 Sep 25 2021 10:36:46

%S 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 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 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 a(n) = gcd(Omega(n), omega(n)).

%H Harry J. Smith, <a href="/A066922/b066922.txt">Table of n, a(n) for n = 1..1000</a>

%t Table[GCD[PrimeOmega[n],PrimeNu[n]],{n,110}] (* _Harvey P. Dale_, Dec 05 2015 *)

%o (PARI) { for (n=1, 1000, write("b066922.txt", n, " ", gcd(bigomega(n),omega(n))) ) } \\ _Harry J. Smith_, Apr 07 2010

%Y Cf. A001221 (omega), A001222 (Omega).

%K nonn

%O 1,6

%A _Benoit Cloitre_, Jan 23 2002

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 April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)