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 A355031 #8 Jun 22 2022 02:30:05
%S A355031 1,4,8,12,16,40,24,36,90,126,48,112,546,72,108,96,160,352,168,120,256,
%T A355031 2475,144,588,300,320,216,448,1216,240,810,420,288,1040,384,660,360,
%U A355031 640,432,1408,540,504,480,600,648,1176,792,672,1500,576,2000,900,1824,1248
%N A355031 a(n) is the least number k such that A355030(k) = n, or -1 if no such k exists.
%H A355031 Amiram Eldar, <a href="/A355031/b355031.txt">Table of n, a(n) for n = 1..10000</a>
%t A355031 m[n_] := Length[Union[Total[#-1]& /@ f[n]]]; 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[60, 10^4] (* using the function f by _T. D. Noe_ at A162247 *)
%Y A355031 Cf. A000005, A001222, A162247, A355029, A355030.
%K A355031 nonn
%O A355031 1,2
%A A355031 _Amiram Eldar_, Jun 16 2022