login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A242643
a(n) = Sum_{d|n, d <= 6} d^2 + 6*Sum_{d|n, d>6} d.
3
1, 5, 10, 21, 26, 50, 43, 69, 64, 90, 67, 138, 79, 131, 125, 165, 103, 212, 115, 226, 178, 203, 139, 330, 176, 239, 226, 315, 175, 405, 187, 357, 274, 311, 278, 516, 223, 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
OFFSET
1,2
REFERENCES
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.
LINKS
MATHEMATICA
sd6[n_]:=Module[{d=Divisors[n]}, Total[Select[d, #<7&]^2]+6Total[Select[ d, #>6&]]]; Array[sd6, 70] (* Harvey P. Dale, Mar 18 2015 *)
CROSSREFS
A row of the array in A242641.
Sequence in context: A080399 A017667 A241603 * A276959 A001157 A242644
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 21 2014
EXTENSIONS
Typo in definition corrected by N. J. A. Sloane, Mar 18 2015
STATUS
approved