The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099314 Exponent of greatest power of 3 dividing the n-th minimal number. 5
 0, 0, 0, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 1, 0, 2, 4, 1, 2, 2, 1, 2, 0, 2, 4, 2, 4, 1, 3, 2, 2, 1, 2, 3, 1, 2, 2, 4, 2, 4, 2, 2, 4, 2, 6, 2, 2, 3, 1, 0, 4, 3, 2, 1, 2, 4, 3, 2, 4, 2, 1, 2, 4, 2, 6, 0, 2, 2, 4, 3, 2, 4, 1, 4, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 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) = A007949(A007416(n)). CROSSREFS Cf. A007416, A007949, A099313, A099312, A099316. Sequence in context: A302301 A277264 A259538 * A214341 A281871 A131334 Adjacent sequences: A099311 A099312 A099313 * A099315 A099316 A099317 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 May 21 22:16 EDT 2024. Contains 372741 sequences. (Running on oeis4.)