The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135874 Multiply the positive divisors n in order (starting at 1). a(n) is the smallest such partial product that is >= n. 2
 1, 2, 3, 8, 5, 6, 7, 8, 27, 10, 11, 24, 13, 14, 15, 64, 17, 36, 19, 40, 21, 22, 23, 24, 125, 26, 27, 56, 29, 30, 31, 64, 33, 34, 35, 144, 37, 38, 39, 40, 41, 252, 43, 88, 135, 46, 47, 144, 343, 100, 51, 104, 53, 324, 55, 56, 57, 58, 59, 120 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 EXAMPLE The positive divisors of 12 are 1,2,3,4,6,12. Checking the partial products: 1=1, 1*2=2, 1*2*3=6, 1*2*3*4=24, 1*2*3*4*6 = 144, 1*2*3*4*6*12 = 1728. 24 is the smallest such product which is >= 12. So a(12) = 24. MAPLE with(numtheory): a:=proc(n) local div, j, pr: div:=divisors(n): for j while product(div[i], i=1..j)< n do pr:=product(div[i], i=1..j+1) end do: pr end proc: 1, seq(a(n), n=2..60); # Emeric Deutsch, Dec 18 2007 MATHEMATICA Table[SelectFirst[FoldList[Times, Divisors[n]], #>=n&], {n, 60}] (* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, Sep 06 2015 *) CROSSREFS Cf. A135875. Sequence in context: A268675 A268385 A093928 * A138682 A065632 A242480 Adjacent sequences:  A135871 A135872 A135873 * A135875 A135876 A135877 KEYWORD nonn AUTHOR Leroy Quet, Dec 03 2007 EXTENSIONS More terms from Emeric Deutsch, Dec 18 2007 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 September 24 22:46 EDT 2021. Contains 347651 sequences. (Running on oeis4.)