|
| |
|
|
A161655
|
|
a(n) = the smallest multiple of {the number of divisors of n} that is >= n.
|
|
2
|
|
|
|
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, 28, 30, 30, 32, 32, 36, 36, 36, 36, 36, 38, 40, 40, 40, 42, 48, 44, 48, 48, 48, 48, 50, 51, 54, 52, 54, 54, 56, 56, 56, 60, 60, 60, 60, 62, 64, 66, 70, 68, 72, 68, 72, 72, 72, 72, 72
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Harvey P. Dale, Table of n, a(n) for n = 1..1000
|
|
|
MAPLE
|
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
|
|
|
MATHEMATICA
|
smd[n_]:=Module[{nd=DivisorSigma[0, n]}, nd Ceiling[n/nd]]; Array[ smd, 80] (* Harvey P. Dale, Oct 10 2011 *)
|
|
|
CROSSREFS
|
Cf. A161654.
Sequence in context: A133691 A111973 A349787 * A092517 A128558 A090346
Adjacent sequences: A161652 A161653 A161654 * A161656 A161657 A161658
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Leroy Quet, Jun 15 2009
|
|
|
EXTENSIONS
|
More terms from Emeric Deutsch, Jun 21 2009
|
|
|
STATUS
|
approved
|
| |
|
|
