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”).

A321165
Sum of distinct products i*j with 1 <= i, j <= n
2
1, 7, 25, 61, 136, 244, 440, 680, 1022, 1472, 2198, 2882, 4065, 5241, 6681, 8265, 10866, 13116, 16726, 19786, 23566, 27922, 34270, 38902, 45502, 52600, 60430, 68326, 80941, 89671, 105047, 116855, 130913, 146519, 163214, 177002, 203013, 224673, 247605, 268005, 303306
OFFSET
1,2
LINKS
FORMULA
a(p) = a(p - 1) + p ^ 2 * (p + 1) / 2 for prime p. - David A. Corneth, Jan 10 2019
EXAMPLE
a(2) = 1 + 2 + 4 = 7.
a(3) = 1 + 2 + 3 + 4 + 6 + 9 = 25.
PROG
(PARI) a(n) = vecsum(setbinop((x, y)->x*y, vector(n, i, i); )); \\ Michel Marcus, Jan 10 2019
CROSSREFS
Column 2 of A321163.
Cf. A027424.
Sequence in context: A061600 A098538 A033814 * A372371 A344560 A118395
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jan 10 2019
STATUS
approved