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 A350049 #19 Dec 15 2021 14:38:12 %S A350049 1,2,4,6,12,24,48,60,120,240,360,720,1260,2520,5040,10080,20160,27720, %T A350049 55440,110880,221760,332640,665280,1081080,2162160,4324320,8648640, %U A350049 17297280,21621600,43243200,73513440,147026880,294053760,367567200,735134400,1396755360,2793510720 %N A350049 a(1) = 1; for n > 1, a(n) is the smallest number with at least as many divisors as 2*a(n-1). %C A350049 Identical to A019505 for 63 terms. A019505(64) = 97039187544499200 (the smallest number with exactly 63360 divisors), but a(64) = 74801040398884800 (the smallest number with at least 63360 divisors; its actual number of divisors is 64512). %C A350049 Subsequence of A002182. %H A350049 Michael De Vlieger, <a href="/A350049/a350049.txt">Concordance of a(n) and A002182</a>, n = 1..10000, terms compactified via A067255 for log_10(a(n)) > 33, giving indices in A002182 and number of divisors of first 1000 terms. %Y A350049 Cf. A019505, A002182, A139770. %K A350049 nonn %O A350049 1,2 %A A350049 _J. Lowell_, Dec 11 2021