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 A048684 #13 Sep 18 2024 08:43:51
%S A048684 2,1,2,1,2,2,2,1,4,2,2,1,2,2,2,1,2,1,2,2,2,2,2,1,2,2,2,2,2,2,2,1,4,2,
%T A048684 2,1,2,2,2,1,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,
%U A048684 2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2
%N A048684 Multiplicity of the maximum squarefree kernel function applied to the binomial coefficients C(n,k).
%H A048684 Amiram Eldar, <a href="/A048684/b048684.txt">Table of n, a(n) for n = 1..10000</a>
%e A048684 For n = 8, 9 or 10 the spectra of squarefree maximal divisors are {1,2,14,14,70,14,14,2,1}, {1,3,6,42,42,42,42,6,3,1} and {1,10,15,30,210,42,30,15,10,1}, respectively. The maxima (70,42 and 210) occur 1, 4 or 4 times. So a(8) = 1, a(9) = 4 and a(10) = 2.
%t A048684 rad[n_] := Times @@ FactorInteger[n][[;;, 1]]; a[n_] := Module[{r = rad /@ Table[Binomial[n, k], {k, 0, n}]}, Count[r, Max[r]]]; Array[a, 100] (* _Amiram Eldar_, Sep 17 2024 *)
%o A048684 (PARI) rad(n) = vecprod(factor(n)[, 1]);
%o A048684 a(n) = {my(r = vector(n+1, k, rad(binomial(n,k-1))), rm = vecmax(r)); #select(x -> x==rm, r);} \\ _Amiram Eldar_, Sep 17 2024
%Y A048684 Cf. A007947, A020233, A020738, A001221, A001222, A000005.
%K A048684 nonn
%O A048684 1,1
%A A048684 _Labos Elemer_