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.

A147843 a(n) = -n*A010815(n).

Original entry on oeis.org

0, 1, 2, 0, 0, -5, 0, -7, 0, 0, 0, 0, 12, 0, 0, 15, 0, 0, 0, 0, 0, 0, -22, 0, 0, 0, -26, 0, 0, 0, 0, 0, 0, 0, 0, 35, 0, 0, 0, 0, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -51, 0, 0, 0, 0, 0, -57, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 70, 0, 0, 0, 0, 0, 0, 77, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -92, 0, 0, 0, 0, 0, 0, 0, -100, 0, 0, 0
Offset: 0

Views

Author

Gary W. Adamson, Nov 15 2008

Keywords

Comments

Convolved with the partition numbers A000041 = sigma(n) prefaced with a 0 gives (0, 1, 3, 4, 7, 6, 12, 8, 15, 13,...).
Triangle A174740 convolves the partition numbers with a variant of this sequence, having row sums = A000203, sigma(n). - Gary W. Adamson, Mar 28 2010

Examples

			a(5) = -5 = (-5) * A010815(5) = (-5) * 1.
		

Crossrefs

Programs

Formula

G.f.: -x * d eta(x)/dx (derivative) where eta(x) = prod(n>=1, 1-x^n). - Joerg Arndt, Mar 14 2010
a(n) = Sum_{k=0..n-1} A010815(k)*sigma(n-k), where sigma(n) = A000203(n) is the sum of divisors of n. - Paul D. Hanna, Jul 02 2011