[go: up one dir, main page]

login
A077479
Number of distinct prime factors of numbers m with BigOmega(m) == 0 modulo omega(m).
3
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
FORMULA
a(n) = A001221(A067340(n)).
MATHEMATICA
PrimeNu /@ Select[ Range[2, 150], Mod[PrimeOmega[#], PrimeNu[#]] == 0 &] (* Jean-François Alcover, Jun 29 2013 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Nov 06 2002
STATUS
approved