|
|
A000441
|
|
a(n) = Sum_{k=1..n-1} k*sigma(k)*sigma(n-k).
(Formerly M4613 N1968)
|
|
9
|
|
|
0, 1, 9, 34, 95, 210, 406, 740, 1161, 1920, 2695, 4116, 5369, 7868, 9690, 13640, 16116, 22419, 25365, 34160, 38640, 50622, 55154, 73320, 77225, 100100, 107730, 135576, 141085, 182340, 184760, 233616, 243408, 297738, 301420, 385110, 377511, 467210, 478842
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. Touchard, On prime numbers and perfect numbers, Scripta Math., 129 (1953), 35-39.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: x*f(x)*f'(x), where f(x) = Sum_{k>=1} k*x^k/(1 - x^k). - Ilya Gutkovskiy, Apr 28 2018
a(n) = (n/24 - n^2/4)*sigma_1(n) + (5*n/24)*sigma_3(n). - Ridouane Oudra, Sep 17 2020
|
|
MAPLE
|
S:=(n, e)->add(k^e*sigma(k)*sigma(n-k), k=1..n-1);
|
|
MATHEMATICA
|
a[n_] := Sum[k*DivisorSigma[1, k]*DivisorSigma[1, n-k], {k, 1, n-1}]; Array[a, 40] (* Jean-François Alcover, Feb 08 2016 *)
|
|
PROG
|
(PARI) a(n) = sum(k=1, n-1, k*sigma(k)*sigma(n-k)); \\ Michel Marcus, Feb 02 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|