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 A061283 #39 Mar 09 2025 05:12:13
%S A061283 1,4,16,64,36,1024,4096,144,65536,262144,576,4194304,1296,900,
%T A061283 268435456,1073741824,9216,5184,68719476736,36864,1099511627776,
%U A061283 4398046511104,3600,70368744177664,46656,589824,4503599627370496,82944
%N A061283 Smallest number with exactly 2n-1 divisors.
%C A061283 The terms are always squares (because the divisors of a nonsquare N come in pairs, d and N/d, and so their number is always even - _N. J. A. Sloane_, Dec 26 2018).
%H A061283 Amiram Eldar, <a href="/A061283/b061283.txt">Table of n, a(n) for n = 1..1661</a> (terms 1..1000 from T. D. Noe)
%F A061283 a(n) = Min{k | A000005(k)=2n-1}.
%F A061283 a((p+1)/2) = 2^(p-1) for odd prime p. [Corrected by _Jianing Song_, Aug 30 2021]
%F A061283 From _Jianing Song_, Aug 30 2021: (Start)
%F A061283 a(n) = A016017(n)^2.
%F A061283 a(n) <= 2^(2n-2), where the equality holds if and only if n=1 or 2n-1 is prime. (End)
%e A061283 For n=15, a(15)=144 with 15 divisors: 1,2,3,4,6,8,9,12,16,18,24,36,48,72 and 144.
%t A061283 mp[1, m_] := {{}}; mp[n_, 1] := {{}}; mp[n_?PrimeQ, m_] := If[m < n, {}, {{n}}]; mp[n_, m_] := Join @@ Table[Map[Prepend[#, d] &, mp[n/d, d]], {d, Select[Rest[Divisors[n]], # <= m &]}]; mp[n_] := mp[n, n]; Table[mulpar = mp[2*n-1] - 1; Min[Table[Product[Prime[s]^mulpar[[j, s]], {s, 1, Length[mulpar[[j]]]}], {j, 1, Length[mulpar]}]], {n, 1, 100}] (* _Vaclav Kotesovec_, Apr 04 2021 *)
%Y A061283 Cf. A000005, A000290, A005408, A003680, A016017, A037992, A055079, A048691.
%Y A061283 Second bisection of A005179.
%K A061283 nonn
%O A061283 1,2
%A A061283 _Labos Elemer_, May 22 2001