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 A347064 #18 Feb 04 2024 17:17:18
%S A347064 1,2,6,24,120,840,7560,83160,1081080,17297280,294053760,5587021440,
%T A347064 128501493120,3212537328000,93163582512000,2888071057872000,
%U A347064 106858629141264000,4381203794791824000,184010559381256608000,7912454053394034144000,371885340509519604768000
%N A347064 Smallest number with at least 2^n divisors.
%C A347064 Begins to differ from A037992 at n=18; a(18) < A037992(18), but the number of divisors d(a(18)) = 276480 > 262144 = 2^18.
%H A347064 Amiram Eldar, <a href="/A347064/b347064.txt">Table of n, a(n) for n = 0..356</a>
%F A347064 a(n) = A061799(2^n). - _Michel Marcus_, Aug 16 2021
%e A347064 n A037992(n) a(n) d(a(n)) 2^n
%e A347064 -- ------------------------ ------------------------ ------- -------
%e A347064 18 188391763176048432000 184010559381256608000 276480 262144
%e A347064 19 8854412869274276304000 7912454053394034144000 552960 524288
%e A347064 20 433866230594439538896000 371885340509519604768000 1105920 1048576
%t A347064 Table[SelectFirst[Table[{n,DivisorSigma[0,n]},{n,0,11*10^5}],#[[2]]==2^k&],{k,0,8}][[;;,1]] (* The program generates the first nine terms of the sequence. *) (* _Harvey P. Dale_, Feb 04 2024 *)
%Y A347064 Cf. A000005, A000079, A037992, A061799.
%K A347064 nonn
%O A347064 0,2
%A A347064 _Jon E. Schoenfield_, Aug 15 2021