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!)
 A099312 Exponent of greatest power of 2 dividing the n-th minimal number. 5
 0, 1, 2, 1, 2, 4, 3, 2, 4, 2, 6, 3, 4, 2, 6, 4, 3, 6, 4, 3, 2, 6, 10, 2, 4, 4, 3, 6, 10, 4, 12, 4, 6, 2, 4, 6, 3, 10, 5, 12, 6, 4, 10, 6, 4, 6, 3, 4, 12, 2, 4, 10, 6, 5, 4, 6, 12, 16, 10, 3, 6, 10, 5, 6, 4, 4, 6, 12, 16, 6, 4, 10, 6, 18, 4, 10, 12, 5, 5, 10, 12, 4, 5, 16 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A minimal number is the smallest number with a given number of divisors, see A007416. LINKS David A. Corneth and Amiram Eldar, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A007814(A007416(n)). CROSSREFS Cf. A007416, A007814, A099311, A099314, A099316. Sequence in context: A208058 A078142 A133422 * A117505 A209128 A209131 Adjacent sequences:  A099309 A099310 A099311 * A099313 A099314 A099315 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 16 04:05 EST 2019. Contains 330013 sequences. (Running on oeis4.)