This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A037019 Let n = p_1*p_2*...*p_k be the prime factorization of n, with the primes sorted in descending order. Then a(n) = 2^(p_1 - 1)*3^(p_2 - 1)*...*A000040(k)^(p_k - 1). 14
 1, 2, 4, 6, 16, 12, 64, 30, 36, 48, 1024, 60, 4096, 192, 144, 210, 65536, 180, 262144, 240, 576, 3072, 4194304, 420, 1296, 12288, 900, 960, 268435456, 720, 1073741824, 2310, 9216, 196608, 5184, 1260, 68719476736, 786432, 36864, 1680, 1099511627776 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS This is an easy way to produce a number with exactly n divisors and it usually produces the smallest such number (A005179(n).) The references call n "ordinary" if A005179(n) = a(n) and "exceptional" or "extraordinary" otherwise. - David Wasserman, Jun 12 2002 LINKS T. D. Noe, Table of n, a(n) for n=1..1000 R. Brown, The minimal number with a given number of divisors, Journal of Number Theory 116 (2006) 150-158. M. E. Grost, The smallest number with a given number of divisors, Amer. Math. Monthly, 75 (1968), 725-729. Anna K. Savvopoulou and Christopher M. Wedrychowicz, On the smallest number with a given number of divisors, The Ramanujan Journal, 2015, Vol. 37, pp. 51-64. EXAMPLE 12 = 3*2*2, so a(12) = 2^2*3*5 = 60. MAPLE a:= n-> (l-> mul(ithprime(i)^(l[i]-1), i=1..nops(l)))(         sort(map(i-> i[1]\$i[2], ifactors(n)[2]), `>`)): seq(a(n), n=1..60);  # Alois P. Heinz, Feb 28 2019 MATHEMATICA (Times@@(Prime[ Range[ Length[ # ] ] ]^Reverse[ #-1 ]))&@Flatten[ FactorInteger[ n ]/.{ a_Integer, b_}:>Table[ a, {b} ] ] PROG (Haskell) a037019 = product .    zipWith (^) a000040_list . reverse . map (subtract 1) . a027746_row -- Reinhard Zumkeller, Nov 25 2012 (PARI) A037019(n, p=1)=prod(i=1, #f=Vecrev(factor(n)~), prod(j=1, f[i][2], (p=nextprime(p+1))^(f[i][1]-1))) \\ M. F. Hasler, Oct 14 2014 CROSSREFS Cf. A005179, A000040, A072066. Cf. A027746. Sequence in context: A136033 A099315 A005179 * A096174 A096173 A287681 Adjacent sequences:  A037016 A037017 A037018 * A037020 A037021 A037022 KEYWORD nonn,nice,easy AUTHOR EXTENSIONS More terms from David Wasserman, Jun 12 2002 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 June 17 07:00 EDT 2019. Contains 324183 sequences. (Running on oeis4.)