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 A346017 #8 Jul 07 2021 08:20:38
%S A346017 1,6,210,30030,9699690,6469693230,6016814703900,9127507905816300,
%T A346017 18446693477654742300,57682810504626379172100,
%U A346017 235749646532408011676372700,1221890417977470724518639704100,8011935470678275540668720539783700,69167038918365552742593064419952682100
%N A346017 a(n) is the least number k such that the average number of distinct prime factors of the divisors of k is equal to n.
%C A346017 This sequence is well-defined since for each n there are infinitely many numbers k such that f(k) = A346009(k)/A346010(k) = n. E.g., if k is a squarefree number (A005117) with 2*n prime factors, then f(k) = n.
%C A346017 All the terms are least integers of their prime signature (A025487) since f(n) depends only on the prime signature of n.
%H A346017 Amiram Eldar, <a href="/A346017/b346017.txt">Table of n, a(n) for n = 0..16</a>
%t A346017 lps = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {_, _}][[;; , 2]]; f[p_, e_] := e/(e + 1); f[1] = 0; f[n_] := Plus @@ f @@@ FactorInteger[n]; s = Table[0, {7}]; Do[n = lps[[k]]; f1 = f[n]; If[IntegerQ[f1] && s[[f1+1]] == 0, s[[f1+1]] = n], {k, 1, Length[lps]}]; s
%Y A346017 Cf. A005117, A346009, A346010.
%Y A346017 Subsequence of A025487, A346014 and A346015.
%K A346017 nonn
%O A346017 0,2
%A A346017 _Amiram Eldar_, Jul 01 2021