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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182693 a(n) = the smallest 3-digit number with exactly n divisors, a(n) = 0 if no such number exists. 1
 0, 101, 121, 106, 625, 116, 729, 102, 100, 112, 0, 108, 0, 192, 144, 120, 0, 180, 0, 240, 576, 0, 0, 360, 0, 0, 900, 960, 0, 720, 0, 840, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS max {n : a(n) > 0} = 32, a(n) = 0 for n > 32. LINKS Table of n, a(n) for n=1..53. FORMULA a(n) = min {99 < k < 1000 : A000005(k)=n} if set is nonempty, else a(n) = 0. MAPLE with (numtheory): b:= n-> `if` (type (n, integer), n, 0): a:= n-> b (min (select (x-> tau(x)=n, [\$100..999])[])): seq (a(n), n=1..60); CROSSREFS Cf. A000005, A182694. Sequence in context: A105992 A038370 A084430 * A328996 A046075 A088882 Adjacent sequences: A182690 A182691 A182692 * A182694 A182695 A182696 KEYWORD nonn,base AUTHOR Jaroslav Krizek, Nov 27 2010 EXTENSIONS Edited by Alois P. Heinz, Nov 27 2010 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 October 2 23:30 EDT 2023. Contains 365841 sequences. (Running on oeis4.)