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 A048243 #18 Jul 22 2024 15:22:34
%S A048243 0,0,0,0,0,2,0,0,4,10,0,8,8,16,8,16,0,16,0,16,32,64,0,32,80,128,224,
%T A048243 320,256,352,64,128,256,512,256,640,640,1024,512,1280,512,1024,512,
%U A048243 1024,2560,3328,1280,2432,2432,3584,3584,5120,2048,2816,2048,4096,8192
%N A048243 Number of non-unitary divisors of binomial(n, floor(n/2)).
%F A048243 a(n) = A048105(A001405(n)).
%F A048243 a(n) = A000005(A001405(n)) - A034444(A001405(n)). [corrected by _Amiram Eldar_, Jul 22 2024]
%e A048243 For n = 10, binomial(10,5) = 252 = 4*9*7 has 18 divisors, 8 are unitary and the residual 10 are non-unitary; thus a(10) = 18 - 8 = 10.
%t A048243 Table[Function[k, DivisorSum[k, 1 &, ! CoprimeQ[#, k/#] &]]@ Binomial[n, Ceiling[n/2]], {n, 57}] (* _Michael De Vlieger_, Jun 29 2017 *)
%t A048243 f[n_] := DivisorSigma[0, n] - 2^PrimeNu[n]; Table[f[Binomial[n, Floor[n/2]]], {n, 1, 60}] (* _Amiram Eldar_, Jul 22 2024 *)
%o A048243 (PARI) a(n) = apply(x -> numdiv(x) - 2^omega(x), binomial(n, n\2)); \\ _Amiram Eldar_, Jul 22 2024
%Y A048243 Cf. A000005, A001405, A034444, A048105.
%K A048243 nonn
%O A048243 1,6
%A A048243 _Labos Elemer_