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 A360806 #13 Mar 14 2023 10:14:44
%S A360806 1,2,8,80,2240,215040,77414400,61931520000,170930995200000,
%T A360806 1340099002368000000
%N A360806 a(0) = 1; for n >= 1, a(n) is the least integer k > a(n-1) such that k / A000005(k) = a(n-1).
%e A360806 a(0) = 1.
%e A360806 a(1) = 2 because the least k > 1 such that k / A000005(k) = 1 is k = 2.
%e A360806 a(2) = 8 because the least k > 2 such that k / A000005(k) = 2 is k = 8.
%e A360806 a(3) = 80 because the least k > 8 such that k / A000005(k) = 8 is k = 80.
%e A360806 and so on.
%t A360806 a[0] = 1; a[n_] := a[n] = Module[{m = a[n - 1], k}, k = 2*m; While[k != m*DivisorSigma[0, k], k += m]; k]; Array[a, 9, 0] (* _Amiram Eldar_, Feb 21 2023 *)
%Y A360806 Cf. A000005, A033950.
%K A360806 nonn,more
%O A360806 0,2
%A A360806 _Ctibor O. Zizka_, Feb 21 2023
%E A360806 a(5)-a(9) from _Amiram Eldar_, Feb 21 2023