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 A323779 #13 Sep 08 2022 08:46:23
%S A323779 1,5,3,44,4,5,5,248,45,20,7,22,8,25,2,8213,10,75,11,176,15,35,13,124,
%T A323779 133,40,119,55,16,10,17,2841,7,50,5,330,20,11,12,992,22,25,23,22,30,
%U A323779 65,25,8213,99,665,5,352,28,119,14,62,33,16,31,88,32,85,225
%N A323779 a(n) = numerator of Sum_{d|n} (tau(d)/sigma(d)) where tau(k) = the number of the divisors of k (A000005) and sigma(k) = the sum of the divisors of k (A000203).
%C A323779 Sum_{d|n} (tau(d)/sigma(d)) >= 1 for all n >= 1.
%F A323779 a(p) = (p+3) / gcd(p+3, p+1) for p = primes p.
%e A323779 For n=4; Sum_{d|4} (tau(d)/sigma(d)) = (tau(1)/sigma(1))+(tau(2)/sigma(2))+(tau(4)/sigma(4)) = (1/1)+(2/3)+(3/7) = 44/21; a(4) = 44.
%t A323779 Array[Numerator@ DivisorSum[#, Divide @@ DivisorSigma[{0, 1}, #] &] &, 63] (* _Michael De Vlieger_, Feb 15 2019 *)
%o A323779 (Magma) [Numerator(&+[NumberOfDivisors(d) / SumOfDivisors(d): d in Divisors(n)]): n in [1..100]]
%o A323779 (PARI) a(n) = numerator(sumdiv(n, d, numdiv(d)/sigma(d))); \\ _Michel Marcus_, Feb 13 2019
%Y A323779 Cf. A000005, A000203, A323780 (denominator).
%K A323779 nonn,frac
%O A323779 1,2
%A A323779 _Jaroslav Krizek_, Jan 27 2019