This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072505 a(n) = n / (LCM of divisors of n which are <= sqrt(n)). 2
 1, 2, 3, 2, 5, 3, 7, 4, 3, 5, 11, 2, 13, 7, 5, 4, 17, 3, 19, 5, 7, 11, 23, 2, 5, 13, 9, 7, 29, 1, 31, 8, 11, 17, 7, 3, 37, 19, 13, 2, 41, 7, 43, 11, 3, 23, 47, 4, 7, 5, 17, 13, 53, 9, 11, 2, 19, 29, 59, 1, 61, 31, 3, 8, 13, 11, 67, 17, 23, 1, 71, 3, 73, 37, 5, 19, 11, 13, 79, 2, 9, 41, 83 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 FORMULA From Robert Israel, Mar 19 2018: (Start) If n = p^k for prime p, then a(n) = p^ceiling(k/2). In particular, a(n) = n if and only if n is prime. If n = p*q for primes p < q, then a(n) = q. (End) EXAMPLE a(20) = 5: the divisors of 20 are 1,2,4,5,10 and 20; a(20) = 20/lcm(1,2,4) = 20/4 = 5. MAPLE f:= proc(n) n/ilcm(op(select(t -> t^2 <= n, numtheory:-divisors(n)))) end proc: map(f, [\$1..100]); # Robert Israel, Mar 19 2018 MATHEMATICA lc[n_]:=Module[{c=Select[Divisors[n], #<=Sqrt[n]&]}, n/LCM@@c]; Array[lc, 90] (* Harvey P. Dale, May 18 2012 *) CROSSREFS Cf. A072504. Sequence in context: A139421 A219964 A165500 * A095163 A033677 A116548 Adjacent sequences:  A072502 A072503 A072504 * A072506 A072507 A072508 KEYWORD nonn,look AUTHOR Amarnath Murthy, Jul 20 2002 EXTENSIONS Corrected and extended by Matthew Conroy, Sep 09 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 April 20 22:22 EDT 2019. Contains 322310 sequences. (Running on oeis4.)