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 A207376 #51 Feb 26 2019 09:13:33
%S A207376 1,3,4,2,6,5,8,6,3,7,12,7,14,9,8,4,18,9,20,9,10,13,24,10,5,15,12,11,
%T A207376 30,11,32,12,14,19,12,6,38,21,16,13,42,13,44,15,14,25,48,14,7,15,20,
%U A207376 17,54,15,16,15,22,31,60,16,62,33,16,8,18,17,68,21,26,17
%N A207376 Sum of central divisors of n.
%C A207376 If n is a square (A000290) then a(n) = sqrt(n) because the squares have only one central divisor. If n is a prime p then a(n) = 1 + p = A000203(n). For the number of central divisors of n see A169695.
%H A207376 Alois P. Heinz, <a href="/A207376/b207376.txt">Table of n, a(n) for n = 1..5000</a>
%H A207376 Omar E. Pol, <a href="http://www.polprimos.com/imagenespub/poldiv05.jpg">Illustration of the divisors of the first 12 positive integers</a>
%F A207376 a(n) = A000203(n) - A323643(n). - _Omar E. Pol_, Feb 26 2019
%e A207376 For n = 12 the divisors of 12 are 1, 2, 3, 4, 6, 12. The central (or middle) divisors of 12 are 3 and 4, so a(12) = 3 + 4 = 7.
%t A207376 cdn[n_]:=Module[{dn=Divisors[n],len},len=Length[dn]; Which[ IntegerQ[ Sqrt[n]], Sqrt[n], PrimeQ[n],n+1, OddQ[len],dn[[Floor[len/2]+1]], EvenQ[len],dn[[len/2]]+dn[[len/2+1]]]]; Array[cdn,70] (* _Harvey P. Dale_, Nov 07 2012 *)
%Y A207376 Row sums of A207375. Where records occur give A008578.
%Y A207376 Cf. A000005, A000040, A000203, A000290, A027750, A161840, A169695, A323643.
%K A207376 nonn,easy
%O A207376 1,2
%A A207376 _Omar E. Pol_, Feb 23 2012