login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135875 Multiply the positive divisors n in order (starting at 1). a(n) is the largest such partial product that is <= n. 1
1, 2, 3, 2, 5, 6, 7, 8, 3, 10, 11, 6, 13, 14, 15, 8, 17, 6, 19, 8, 21, 22, 23, 24, 5, 26, 27, 8, 29, 30, 31, 8, 33, 34, 35, 24, 37, 38, 39, 40, 41, 36, 43, 8, 15, 46, 47, 24, 7, 10, 51, 8, 53, 36, 55, 56, 57, 58, 59, 24, 61, 62, 21, 64, 65, 36, 67, 8, 69, 70, 71, 24, 73, 74, 15, 8, 77, 36, 79, 40 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..80.

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. 6 is the largest such product that is <= 12. So a(12) = 6.

PROG

(PARI) for(n=1, 80, d=divisors(n); L=numdiv(n); T=1; i=1; while(i<=L&&T*d[i]<=n, T*=d[i]; i++); print1(T", "))

CROSSREFS

Cf. A135874.

Sequence in context: A293303 A110500 A161871 * A097448 A066729 A241592

Adjacent sequences:  A135872 A135873 A135874 * A135876 A135877 A135878

KEYWORD

nonn

AUTHOR

Leroy Quet, Dec 03 2007

EXTENSIONS

More terms from Robert Gerbicz, Nov 26 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 07:23 EDT 2019. Contains 328252 sequences. (Running on oeis4.)