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 A321297 #32 Feb 11 2019 19:36:14
%S A321297 0,0,0,2,0,1,0,2,3,3,0,5,0,5,2,10,0,10,0,9,4,9,0,17,5,11,6,15,0,21,0,
%T A321297 18,8,15,2,36,0,17,10,27,0,31,0,27,16,21,0,45,7,28,14,33,0,43,6,37,16,
%U A321297 27,0,67,0,29,20,50,8,55,0,45,20,45,0,76,0,35,32
%N A321297 a(n) is the sum of proper divisors of n that are >= sqrt(n) minus the sum of the divisors that are greater than 1 and less than sqrt(n).
%F A321297 a(p) = 0, for primes p.
%F A321297 a(n) = 2*A070038(n) - sigma(n) - n + 1 for n > 1. - _Andrew Howroyd_, Nov 25 2018
%t A321297 Array[Function[{d, s}, 1 + Subtract @@ (Total /@ Reverse@ TakeDrop[d, LengthWhile[d, # < s &]])] @@ {Most@ Divisors[#], Sqrt@ #} &, 74, 2] (* _Michael De Vlieger_, Nov 25 2018 *)
%o A321297 (PARI) a(n)=sumdiv(n, d, if(d>1&&d<n, if(d>=n/d, d, -d)))
%Y A321297 Cf. A000203 (sigma), A070038, A079667.
%K A321297 nonn
%O A321297 1,4
%A A321297 _Nathaniel J. Strout_, Nov 02 2018