A321258 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A321258

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = sigma_k(n) - n^k.

0, 0, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 3, 1, 0, 1, 1, 5, 1, 3, 0, 1, 1, 9, 1, 6, 1, 0, 1, 1, 17, 1, 14, 1, 3, 0, 1, 1, 33, 1, 36, 1, 7, 2, 0, 1, 1, 65, 1, 98, 1, 21, 4, 3, 0, 1, 1, 129, 1, 276, 1, 73, 10, 8, 1, 0, 1, 1, 257, 1, 794, 1, 273, 28, 30, 1, 5

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,10

COMMENTS

A(n,k) is the sum of k-th powers of proper divisors of n.

LINKS

Table of n, a(n) for n=1..78.

Eric Weisstein's World of Mathematics, Proper divisors

Index entries for sequences related to sums of divisors

FORMULA

G.f. of column k: Sum_{j>=1} j^k*x^(2*j)/(1 - x^j).

Dirichlet g.f. of column k: zeta(s-k)*(zeta(s) - 1).