The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099311 Exponent of greatest power of 2 dividing the smallest number having exactly n divisors. 5
 0, 1, 2, 1, 4, 2, 6, 3, 2, 4, 10, 2, 12, 6, 4, 3, 16, 2, 18, 4, 6, 10, 22, 3, 4, 12, 2, 6, 28, 4, 30, 3, 10, 16, 6, 2, 36, 18, 12, 4, 40, 6, 42, 10, 4, 22, 46, 3, 6, 4, 16, 12, 52, 2, 10, 6, 18, 28, 58, 4, 60, 30, 6, 3, 12, 10, 66, 16, 22, 6, 70, 5, 72, 36, 4, 18, 10, 12, 78, 4, 2, 40, 82, 6, 16 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS a(n) = A007814(A005179(n)). LINKS David Wasserman, Table of n, a(n) for n = 1..2000 CROSSREFS Cf. A099312, A099313, A099315. Sequence in context: A131888 A109170 A225368 * A349442 A130742 A130107 Adjacent sequences: A099308 A099309 A099310 * A099312 A099313 A099314 KEYWORD nonn AUTHOR Reinhard Zumkeller, Oct 12 2004 STATUS approved

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

Last modified December 5 19:04 EST 2022. Contains 358588 sequences. (Running on oeis4.)