This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A318279 #38 Feb 25 2024 06:00:24
%S A318279 4,9,8,25,11,49,16,27,22,121,20,169,34,37,32,289,33,361,37,58,62,529,
%T A318279 38,125,78,81,55,841,49,961,64,106,111,115,57,1369,128,133,68,1681,72,
%U A318279 1849,94,97,165,2209,74,343,110,190,115,2809,96,210,100,220,225
%N A318279 a(n) is the least k such that k^(tau(n)-1) >= n^tau(n).
%C A318279 For prime p and m > 0, a(p^m) = p^(m+1). - _Muniru A Asiru_, Nov 23 2018
%H A318279 David A. Corneth, <a href="/A318279/b318279.txt">Table of n, a(n) for n = 2..10001</a> (first 499 terms by Muniru A Asiru)
%F A318279 a(n) = ceiling(n^(1 + 1/(tau(n)-1))). - _Jon E. Schoenfield_, Nov 22 2018
%e A318279 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.
%t A318279 Array[Block[{k = 1}, While[k^(#2 - 1) < #1^#2, k++] & @@ {#, DivisorSigma[0, #]}; k] &, 55, 2] (* _Michael De Vlieger_, Oct 10 2018 *)
%o A318279 (PARI) a(n) = my(nd = numdiv(n)); res = ceil(n ^ (nd / (nd - 1))); while(res^(nd-1) >= n^nd, res--); res+1
%o A318279 (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
%Y A318279 Cf. A000005, A291899.
%K A318279 nonn,easy
%O A318279 2,1
%A A318279 _David A. Corneth_, Oct 09 2018
%E A318279 Correct value a(27) = 81 inserted by _Muniru A Asiru_, Nov 22 2018