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 A322351 #9 Dec 05 2018 17:24:09
%S A322351 1,1,1,1,1,1,1,1,2,1,1,2,1,1,1,1,1,2,1,2,1,1,1,2,4,1,2,2,1,1,1,1,1,1,
%T A322351 1,2,1,1,1,4,1,1,1,2,3,1,1,2,6,4,1,2,1,2,1,4,1,1,1,2,1,1,3,1,1,1,1,2,
%U A322351 1,1,1,2,1,1,5,2,1,1,1,4,2,1,1,2,1,1,1,4,1,3,1,2,1,1,1,2,1,6,3,4,1,1,1,4,1
%N A322351 a(n) = min(A003557(n), A173557(n)).
%H A322351 Antti Karttunen, <a href="/A322351/b322351.txt">Table of n, a(n) for n = 1..16384</a>
%F A322351 a(n) = min(A003557(n), A173557(n)).
%F A322351 a(n) = A000010(n) / A322352(n).
%t A322351 a[n_] := If[n == 1, 1, Module[{f=FactorInteger[n]}, Min[ Times@@ (First[#]^(Last[#]-1)& /@ f), Times@@((#-1)& @@@ f)]]]; Array[a, 120] (* _Amiram Eldar_, Dec 05 2018 *)
%o A322351 (PARI)
%o A322351 A003557(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 2] = f[i, 2]-1); factorback(f); }; \\ From A003557
%o A322351 A173557(n) = factorback(apply(p -> p-1, factor(n)[, 1]));
%o A322351 A322351(n) = min(A003557(n), A173557(n));
%Y A322351 Cf. A000010, A003557, A173557, A322320, A322321, A322352, A322355.
%K A322351 nonn
%O A322351 1,9
%A A322351 _Antti Karttunen_, Dec 05 2018