login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 9 18:32 EDT 2020. Contains 336326 sequences. (Running on oeis4.)