A077480 Total number of prime factors of numbers m with bigomega(m) == 0 modulo omega(m) (counted with repetition).

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

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 A363369

Adjacent sequences: A077477 A077478 A077479 * A077481 A077482 A077483

Keyword

nonn

Author

Reinhard Zumkeller, Nov 06 2002

Status

approved