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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244063 Number of prime factors (with multiplicity) of the number of distinct prime factors of n; i.e., Omega(omega(n)). 1
 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2 COMMENTS This sequence is not the same as A143731 and first departs from it when n = 210. The characteristic function A143731(210)=1, while a(210)=2. This is because 210 is the smallest number with 4 distinct prime factors (210 = 2*3*5*7) and 4 is the smallest composite number. Thus, Omega(omega(210)) = Omega(4) = 2. The records for this sequence are at 2, 6, 210, 9699690, 32589158477190044730, ..., the products of the first 2^n primes. - Charles R Greathouse IV, Sep 14 2015 LINKS G. C. Greubel, Table of n, a(n) for n = 2..5000 FORMULA a(n) = Omega(omega(n)) = A001222(A001221(n)). a(n) << log log n. - Charles R Greathouse IV, Sep 14 2015 MATHEMATICA Table[PrimeOmega[PrimeNu[n]], {n, 2, 100}] PROG (PARI) a(n)=bigomega(omega(n)) \\ Charles R Greathouse IV, Sep 14 2015 CROSSREFS Cf. A143731, A001221, A001222. Sequence in context: A341996 A341999 A118685 * A080343 A011664 A179831 Adjacent sequences:  A244060 A244061 A244062 * A244064 A244065 A244066 KEYWORD nonn AUTHOR Wesley Ivan Hurt, Jun 15 2014 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.

Last modified June 23 23:39 EDT 2021. Contains 345403 sequences. (Running on oeis4.)