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 A355033 #10 Jun 22 2022 02:32:43
%S A355033 1,36,72,288,960,720,1440,3456,2880,6912,5760,10080,11520,8640,24192,
%T A355033 21600,47520,17280,28800,20160,62208,46080,82944,34560,50400,40320,
%U A355033 57600,51840,110880,126720,141120,69120,60480,248832,86400,80640,233280,237600,103680,100800
%N A355033 a(n) is the least number k such that A355032(k) = n, or -1 if no such k exists.
%H A355033 Amiram Eldar, <a href="/A355033/b355033.txt">Table of n, a(n) for n = 1..250</a>
%t A355033 m[n_] := Max[Tally[Total[# - 1] & /@ f[n]][[;; , 2]]]; seq[len_, max_] := Module[{s = Table[0, {len}], c = 0, n = 1, k}, While[c < len && n < max, k = m[n]; If[k <= len && s[[k]] == 0, c++; s[[k]] = n]; n++]; s]; seq[30, 10^6] (* using the function f by _T. D. Noe_ at A162247 *)
%Y A355033 Cf. A000005, A001222, A162247, A355030, A355031, A355032.
%K A355033 nonn
%O A355033 1,2
%A A355033 _Amiram Eldar_, Jun 16 2022