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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161654 a(n) = the largest multiple of {the number of divisors of n} that is <= n. 2
 1, 2, 2, 3, 4, 4, 6, 8, 9, 8, 10, 12, 12, 12, 12, 15, 16, 18, 18, 18, 20, 20, 22, 24, 24, 24, 24, 24, 28, 24, 30, 30, 32, 32, 32, 36, 36, 36, 36, 40, 40, 40, 42, 42, 42, 44, 46, 40, 48, 48, 48, 48, 52, 48, 52, 56, 56, 56, 58, 60, 60, 60, 60, 63, 64, 64, 66, 66, 68, 64, 70, 72, 72 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Enrique Pérez Herrero, Table of n, a(n) for n = 1..5000 FORMULA a(n) = floor(n/tau(n)) = floor(n/A000005(n)). - Enrique Pérez Herrero, Apr 28 2012 MAPLE with(numtheory): a := proc (n) local k: for k while 0 <= n-k*tau(n) do end do: (k-1)*tau(n) end proc; seq(a(n), n = 1 .. 75); # Emeric Deutsch, Jun 20 2009 MATHEMATICA A161654[n_]:=Floor[n, DivisorSigma[0, n]]; Table[A161654[n], {n, 1, 100}] (* Enrique Pérez Herrero, Apr 28 2012 *) CROSSREFS Cf. A161655, A000005. Sequence in context: A330715 A018125 A292420 * A325854 A301370 A342520 Adjacent sequences: A161651 A161652 A161653 * A161655 A161656 A161657 KEYWORD nonn AUTHOR Leroy Quet, Jun 15 2009 EXTENSIONS More terms from Emeric Deutsch, Jun 20 2009 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 June 4 15:27 EDT 2023. Contains 363128 sequences. (Running on oeis4.)