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 A331597 #9 Jan 24 2020 20:58:13
%S A331597 1,2,2,3,2,3,2,5,3,3,2,5,2,3,6,7,2,15,2,5,6,3,2,7,3,3,5,5,2,15,2,11,6,
%T A331597 3,6,7,2,3,6,7,2,15,2,5,10,3,2,11,3,15,6,5,2,7,6,7,6,3,2,7,2,3,10,13,
%U A331597 6,15,2,5,6,15,2,11,2,3,15,5,6,15,2,11,7,3,2,7,6,3,6,7,2,7,6,5,6,3,6,13,2,15,10,7,2,15,2,7,30
%N A331597 a(n) = A007947(A331595(n)).
%H A331597 Antti Karttunen, <a href="/A331597/b331597.txt">Table of n, a(n) for n = 1..65537</a>
%H A331597 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A331597 a(n) = A007947(A331595(n)) = A007947(gcd(A122111(n), A241909(n))).
%t A331597 Array[Times @@ FactorInteger[#][[All, 1]] &@ If[# == 1, 1, GCD @@ {Block[{k = #, m = 0}, Times @@ Power @@@ Table[k -= m; k = DeleteCases[k, 0]; {Prime@ Length@ k, m = Min@ k}, Length@ Union@ k]] &@ Catenate[ConstantArray[PrimePi[#1], #2] & @@@ #], Function[t, Times @@ Prime@ Accumulate[If[Length@ t < 2, {0}, Join[{1}, ConstantArray[0, Length@ t - 2], {-1}]] + ReplacePart[t, Map[#1 -> #2 & @@ # &, #]]]]@ ConstantArray[0, Transpose[#][[1, -1]]] &[# /. {p_, e_} /; p > 0 :> {PrimePi@ p, e}]} &@ FactorInteger[#]] &, 105] (* _Michael De Vlieger_, Jan 24 2020, after _JungHwan Min_ at A122111 *)
%o A331597 (PARI) A331597(n) = factorback(factorint(gcd(A122111(n), A241909(n)))[, 1]);
%Y A331597 Cf. A007947, A064989, A122111, A241909, A331595, A331596.
%K A331597 nonn
%O A331597 1,2
%A A331597 _Antti Karttunen_, Jan 22 2020