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!)
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
MATHEMATICA
PrimeOmega[Select[Range[2, 500], Divisible[PrimeOmega[#], PrimeNu[#]] &]] (* G. C. Greubel, May 08 2017 *)
CROSSREFS
Equals A001222(A067340(n)).
Sequence in context: A330234 A332423 A256106 * A327524 A059829 A363369
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 5 09:09 EST 2024. Contains 370545 sequences. (Running on oeis4.)