A077481 -id:A077481 - cp's OEIS frontend

A077479 Number of distinct prime factors of numbers m with BigOmega(m) == 0 modulo omega(m).

1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 1, 2, 2, 3, 1, 1, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 3, 1, 2, 3, 2, 1, 1, 3, 2, 1, 3, 2, 2, 2, 1, 2, 2, 1, 1, 1, 2, 3, 1, 2, 2, 2

Offset: 1

Reinhard Zumkeller, Nov 06 2002

nonn

G. C. Greubel, Table of n, a(n) for n = 1..1000

Cf. A001221, A067340, A077480, A077481, A001222.

PrimeNu /@ Select[ Range[2, 150], Mod[PrimeOmega[#], PrimeNu[#]] == 0 &] (* Jean-François Alcover, Jun 29 2013 *)

a(n) = A001221(A067340(n)).

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

Original entry on oeis.org

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

Reinhard Zumkeller, Nov 06 2002

nonn

G. C. Greubel, Table of n, a(n) for n = 1..5000

Equals A001222(A067340(n)).

Cf. A077479, A077481, A001221.

PrimeOmega[Select[Range[2,500], Divisible[PrimeOmega[#], PrimeNu[#]] &]] (* G. C. Greubel, May 08 2017 *)

cp's OEIS Frontend

A077479 Number of distinct prime factors of numbers m with BigOmega(m) == 0 modulo omega(m).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula