This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A108602 Number of distinct prime factors of highly composite numbers (definition 1, A002182). 12
 0, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 7, 7, 8, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 8, 9, 8, 9, 8, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS n appears A086334(n) times. - Lekraj Beedassy, Sep 02 2006 LINKS T. D. Noe, Table of n, a(n) for n = 1..10000 (using data from Flammenkamp) A. Flammenkamp, Highly composite numbers A. Flammenkamp, List of the first 1200 highly composite numbers A. Flammenkamp, List of the first 779,674 highly composite numbers FORMULA a(n) = A001221(A002182(n)). EXAMPLE A002182(8) = 48 = 2^4*3, which has 2 distinct prime factors, so a(8)=2. CROSSREFS Cf. A002182, A002183. Cf. A212182, A318490. Sequence in context: A000196 A111850 A059396 * A305025 A085290 A108611 Adjacent sequences:  A108599 A108600 A108601 * A108603 A108604 A108605 KEYWORD nonn AUTHOR Jud McCranie, Jun 12 2005 EXTENSIONS Edited by Ray Chandler, Nov 11 2005 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 December 14 15:08 EST 2019. Contains 329979 sequences. (Running on oeis4.)