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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161655 a(n) = the smallest multiple of {the number of divisors of n} that is >= n. 2

%I #12 Feb 21 2019 23:14:36

%S 1,2,4,6,6,8,8,8,9,12,12,12,14,16,16,20,18,18,20,24,24,24,24,24,27,28,

%T 28,30,30,32,32,36,36,36,36,36,38,40,40,40,42,48,44,48,48,48,48,50,51,

%U 54,52,54,54,56,56,56,60,60,60,60,62,64,66,70,68,72,68,72,72,72,72,72

%N a(n) = the smallest multiple of {the number of divisors of n} that is >= n.

%H Harvey P. Dale, <a href="/A161655/b161655.txt">Table of n, a(n) for n = 1..1000</a>

%p with(numtheory): a := proc (n) local k: for k while k*tau(n) < n do end do: k*tau(n) end proc: seq(a(n), n = 1 .. 75); # _Emeric Deutsch_, Jun 21 2009

%t smd[n_]:=Module[{nd=DivisorSigma[0,n]},nd Ceiling[n/nd]];Array[ smd,80] (* _Harvey P. Dale_, Oct 10 2011 *)

%Y Cf. A161654.

%K nonn

%O 1,2

%A _Leroy Quet_, Jun 15 2009

%E More terms from _Emeric Deutsch_, Jun 21 2009

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 8 03:07 EDT 2023. Contains 363157 sequences. (Running on oeis4.)