Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099313
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099313 Exponent of greatest power of 3 dividing the smallest number having exactly n divisors. +0
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 (list; graph; listen)
OFFSET

1,9

COMMENT

a(n) = A007949(A005179(n)).

CROSSREFS

Cf. A099314, A099311, A099315.

Sequence in context: A050317 A141095 A159195 this_sequence A097468 A098381 A030372

Adjacent sequences: A099310 A099311 A099312 this_sequence A099314 A099315 A099316

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 12 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research