|
|
A318279
|
|
a(n) is the least k such that k^(tau(n)-1) >= n^tau(n).
|
|
1
|
|
|
4, 9, 8, 25, 11, 49, 16, 27, 22, 121, 20, 169, 34, 37, 32, 289, 33, 361, 37, 58, 62, 529, 38, 125, 78, 81, 55, 841, 49, 961, 64, 106, 111, 115, 57, 1369, 128, 133, 68, 1681, 72, 1849, 94, 97, 165, 2209, 74, 343, 110, 190, 115, 2809, 96, 210, 100, 220, 225
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
For prime p and m > 0, a(p^m) = p^(m+1). - Muniru A Asiru, Nov 23 2018
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
As tau(4) = 3, we look for the least k such that k^(3-1) >= 4^3, for which we find k = 8. Therefore, a(4) = 8.
|
|
MATHEMATICA
|
Array[Block[{k = 1}, While[k^(#2 - 1) < #1^#2, k++] & @@ {#, DivisorSigma[0, #]}; k] &, 55, 2] (* Michael De Vlieger, Oct 10 2018 *)
|
|
PROG
|
(PARI) a(n) = my(nd = numdiv(n)); res = ceil(n ^ (nd / (nd - 1))); while(res^(nd-1) >= n^nd, res--); res+1
(GAP) List(List([2..57], n->Filtered([2..3000], k->k^(Tau(n)-1) >= n^Tau(n))), i->i[1]); # Muniru A Asiru, Oct 09 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|