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 A073356 #10 Apr 06 2025 08:46:06
%S A073356 1,1,3,2,1,1,1,2,1,1,1,2,1,1,5,2,17,1,1,2,7,1,1,2,1,1,1,2,1,3,1,2,3,1,
%T A073356 1,6,1,1,3,2,1,3,1,2,1,1,1,2,1,1,1,2,53,1,1,2,1,1,1,2,1,1,1,2,1,3,1,2,
%U A073356 1,1,1,2,1,1,1,2,1,3,1,2,1,1,1,14,1,1,1,2,1,1,7,2,1,1,1,2,1,1,1,2,1,1
%N A073356 Greatest common divisor of squarefree kernel of n and sum of squarefree kernels of numbers <= n.
%H A073356 Amiram Eldar, <a href="/A073356/b073356.txt">Table of n, a(n) for n = 1..10000</a>
%F A073356 a(n) = GCD(A007947(n), A073355(n)).
%t A073356 rad[n_] := Times @@ FactorInteger[n][[;; , 1]]; seq[nmax_] := Module[{v = Array[rad, nmax]}, GCD[v, Accumulate[v]]]; seq[100] (* _Amiram Eldar_, Apr 06 2025 *)
%Y A073356 Cf. A007947, A073355.
%K A073356 nonn
%O A073356 1,3
%A A073356 _Reinhard Zumkeller_, Jul 29 2002