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!)
 A099313 Exponent of greatest power of 3 dividing the smallest number having exactly n divisors. 5
 0, 0, 0, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 2, 0, 1, 2, 1, 0, 2, 4, 1, 2, 1, 0, 2, 0, 1, 2, 1, 4, 2, 0, 1, 2, 1, 0, 2, 0, 1, 2, 1, 0, 2, 6, 4, 2, 1, 0, 2, 4, 1, 2, 1, 0, 2, 0, 1, 2, 3, 4, 2, 0, 1, 2, 4, 0, 2, 0, 1, 4, 1, 6, 2, 0, 3, 2, 1, 0, 2, 4, 1, 2, 1, 0, 2, 6, 1, 2, 1, 4, 2, 0, 6, 2, 4, 0, 2, 0, 1, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS a(n) = A007949(A005179(n)). LINKS Antti Karttunen, Table of n, a(n) for n = 1..2000 (computed from the b-file of A005179 provided by Don Reble) CROSSREFS Cf. A099314, A099311, A099315. Sequence in context: A159195 A265859 A271420 * A316491 A097468 A283144 Adjacent sequences:  A099310 A099311 A099312 * A099314 A099315 A099316 KEYWORD nonn AUTHOR Reinhard Zumkeller, Oct 12 2004 EXTENSIONS More terms from Antti Karttunen, Oct 05 2017 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 9 00:32 EST 2019. Contains 329871 sequences. (Running on oeis4.)