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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077480 Total number of prime factors of numbers m with bigomega(m) == 0 modulo omega(m) (counted with repetition). 3
 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 1, 2, 2, 4, 1, 1, 2, 2, 1, 4, 2, 2, 3, 1, 3, 1, 5, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 2, 1, 2, 2, 1, 4, 2, 4, 2, 2, 1, 1, 2, 6, 2, 3, 1, 2, 3, 1, 1, 2, 2, 3, 1, 4, 2, 1, 2, 2, 2, 4, 1, 2, 2, 2, 2, 6, 1, 4, 1, 3, 1, 4, 3, 2, 1, 1, 3, 2, 1, 3, 2, 2, 2, 2, 2, 2, 3, 1, 7, 2, 3, 1, 2, 2, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS G. C. Greubel, Table of n, a(n) for n = 1..5000 MATHEMATICA PrimeOmega[Select[Range[2, 500], Divisible[PrimeOmega[#], PrimeNu[#]] &]] (* G. C. Greubel, May 08 2017 *) CROSSREFS Equals A001222(A067340(n)). Cf. A077479, A077481, A001221. Sequence in context: A330234 A332423 A256106 * A327524 A059829 A304465 Adjacent sequences: A077477 A077478 A077479 * A077481 A077482 A077483 KEYWORD nonn AUTHOR Reinhard Zumkeller, Nov 06 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 January 30 12:36 EST 2023. Contains 359945 sequences. (Running on oeis4.)