cp's OEIS Frontend

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.

A321165 Sum of distinct products i*j with 1 <= i, j <= n.

Original entry on oeis.org

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

Views

Author

Seiichi Manyama, Jan 10 2019

Keywords

Examples

			a(2) = 1 + 2 + 4 = 7.
a(3) = 1 + 2 + 3 + 4 + 6 + 9 = 25.
		

Crossrefs

Column 2 of A321163.
Cf. A027424.

Programs

  • PARI
    a(n) = vecsum(setbinop((x, y)->x*y, vector(n, i, i); )); \\ Michel Marcus, Jan 10 2019

Formula

a(p) = a(p - 1) + p ^ 2 * (p + 1) / 2 for prime p. - David A. Corneth, Jan 10 2019