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 A242643 #11 Mar 18 2015 16:05:16
%S A242643 1,5,10,21,26,50,43,69,64,90,67,138,79,131,125,165,103,212,115,226,
%T A242643 178,203,139,330,176,239,226,315,175,405,187,357,274,311,278,516,223,
%U A242643 347,322,514,247,554,259,483,449,419,283,714,337,540,418,567,319,698,422,699,466,527,355,973,367,563,610,741,494,842
%N A242643 a(n) = Sum_{d|n, d <= 6} d^2 + 6*Sum_{d|n, d>6} d.
%D A242643 P. A. MacMahon, The connexion between the sum of the squares of the divisors and the number of partitions of a given number, Messenger Math., 54 (1924), 113-116. Collected Papers, MIT Press, 1978, Vol. I, pp. 1364-1367. See Table I. Note that the entry 53 should be 50.
%H A242643 Harvey P. Dale, <a href="/A242643/b242643.txt">Table of n, a(n) for n = 1..1000</a>
%t A242643 sd6[n_]:=Module[{d=Divisors[n]},Total[Select[d,#<7&]^2]+6Total[Select[ d,#>6&]]];Array[sd6,70] (* _Harvey P. Dale_, Mar 18 2015 *)
%Y A242643 A row of the array in A242641.
%K A242643 nonn
%O A242643 1,2
%A A242643 _N. J. A. Sloane_, May 21 2014
%E A242643 Typo in definition corrected by _N. J. A. Sloane_, Mar 18 2015