|
|
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
|
|
|
FORMULA
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|