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 A351946 #9 Apr 03 2022 13:53:13
%S A351946 0,1,1,1,1,2,1,1,1,2,1,1,1,2,2,1,1,1,1,1,2,2,1,1,1,2,1,1,1,3,1,1,2,2,
%T A351946 2,2,1,2,2,1,1,3,1,1,1,2,1,1,1,1,2,1,1,1,2,1,2,2,1,2,1,2,1,1,2,3,1,1,
%U A351946 2,3,1,1,1,2,1,1,2,3,1,1,1,2,1,2,2,2,2,1,1,2,2,1,2,2,2,1,1,1,1,2,1,3,1,1,3
%N A351946 a(n) = A051903(A181819(n)).
%H A351946 Michael De Vlieger, <a href="/A351946/b351946.txt">Table of n, a(n) for n = 1..10000</a>
%H A351946 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F A351946 a(n) = A051903(A181819(n)).
%t A351946 {0}~Join~Array[Max[FactorInteger[#][[All, -1]]] &@ Apply[Times, Prime[FactorInteger[#][[All, -1]]]] &, 104, 2] (* _Michael De Vlieger_, Apr 03 2022 *)
%o A351946 (PARI)
%o A351946 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A351946 A181819(n) = factorback(apply(e->prime(e),(factor(n)[,2])));
%o A351946 A351946(n) = A051903(A181819(n));
%Y A351946 Cf. A051903, A181819.
%Y A351946 Differs from A327500 for the first time at n=450, where a(450) = 2, while A327500(450) = 3. See A351947 for all such positions.
%K A351946 nonn
%O A351946 1,6
%A A351946 _Antti Karttunen_, Apr 03 2022