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!)
 A113901 Product of omega(n) and bigomega(n) = A001221(n)*A001222(n), where omega(x): number of distinct prime divisors of x. bigomega(x): number of prime divisors of x, counted with multiplicity. 14
 0, 1, 1, 2, 1, 4, 1, 3, 2, 4, 1, 6, 1, 4, 4, 4, 1, 6, 1, 6, 4, 4, 1, 8, 2, 4, 3, 6, 1, 9, 1, 5, 4, 4, 4, 8, 1, 4, 4, 8, 1, 9, 1, 6, 6, 4, 1, 10, 2, 6, 4, 6, 1, 8, 4, 8, 4, 4, 1, 12, 1, 4, 6, 6, 4, 9, 1, 6, 4, 9, 1, 10, 1, 4, 6, 6, 4, 9, 1, 10, 4, 4, 1, 12, 4, 4, 4, 8, 1, 12, 4, 6, 4, 4, 4, 12, 1, 6, 6, 8, 1, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS a(n) = 1 iff n is prime. A068993(a(n)) = 4. - Reinhard Zumkeller, Mar 13 2011 Positions of first appearances are A328964. - Gus Wiseman, Nov 05 2019 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 MATHEMATICA Table[PrimeNu[n]*PrimeOmega[n], {n, 1, 50}] (* G. C. Greubel, Apr 23 2017 *) PROG (PARI) list(n) = { local(x); for(x=1, n, print1(omega(x)*bigomega(x)", ") ) } CROSSREFS A307409(n) is (bigomega(n) - 1) * omega(n). A328958(n) is sigma_0(n) - bigomega(n) * omega(n). Cf. A000005, A001221, A001222, A060687, A070175, A071625, A124010, A303555, A320632, A323023, A328956, A328957, A328964, A328965. Sequence in context: A214057 A067614 A341308 * A062799 A063647 A263653 Adjacent sequences:  A113898 A113899 A113900 * A113902 A113903 A113904 KEYWORD easy,nonn AUTHOR Cino Hilliard, Jan 29 2006 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 May 9 10:56 EDT 2021. Contains 343732 sequences. (Running on oeis4.)