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,5

Links

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

Formula

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

Mathematica

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

Crossrefs

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

Sequence in context: A157230 A034380 A328966 * A335225 A070106 A182595

Adjacent sequences: A077476 A077477 A077478 * A077480 A077481 A077482

Keyword

nonn

Author

Reinhard Zumkeller, Nov 06 2002

Status

approved