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 A078713 #5 Apr 10 2018 14:54:24
%S A078713 0,1,4,5,16,11,36,21,40,35,100,43,144,75,108,85,256,101,324,131,216,
%T A078713 203,484,171,416,291,364,259,784,273,900,341,552,515,804,385,1296,651,
%U A078713 780,519,1600,551,1764,659,960,971,2116,683,1800,885,1356,931,2704,911,1988
%N A078713 Sum of squares of the distances between successive divisors of n.
%H A078713 Harvey P. Dale, <a href="/A078713/b078713.txt">Table of n, a(n) for n = 1..1000</a>
%e A078713 The divisors of 10 are 1, 2, 5, 10 and the sum of the squares of the distances between successive divisors = (2-1)^2 + (5-2)^2 + (10-5)^2 = 35. Hence a(10) = 35.
%t A078713 f[n_] := Module[{d, l, s, i}, d = Divisors[n]; l = Length[d]; s = 0; For[i = 1, i < l, i++, s = s + (d[[i + 1]] - d[[i]])^2]; s]; Table[f[n], {n, 1, 100}]
%t A078713 Table[Total[Differences[Divisors[n]]^2],{n,60}] (* _Harvey P. Dale_, Apr 10 2018 *)
%K A078713 nonn
%O A078713 1,3
%A A078713 _Joseph L. Pe_, Dec 19 2002