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.

A141846 Triangle read by rows: A051731 * A051953^(n-k) * 0^(n-k), 1 <= k <= n.

Original entry on oeis.org

0, 0, 1, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 4, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 4, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 1, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 0, 4, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 8
Offset: 1

Views

Author

Gary W. Adamson, Jul 11 2008

Keywords

Comments

Row sums = A001065: (0, 1, 1, 3, 1, 6, 1, 7, 4, 8,...).
n-th row = (p-1) zeros followed by 1, iff n is prime.
For T(n,k), k divides n if k not = 0.

Examples

			First few rows of the triangle =
0;
0, 1;
0, 0, 1;
0, 1, 0, 2;
0, 0, 0, 0, 1;
0, 1, 1, 0, 0, 4;
0, 0, 0, 0, 0, 0, 1;
0, 1, 0, 2, 0, 0, 0, 4;
0, 0, 1, 0, 0, 0, 0, 0, 3;
0, 1, 0, 0, 1, 0, 0, 0, 0, 6;
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 1, 1, 2, 0, 4, 0, 0, 0, 0, 0, 8;
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 8;
...
		

Crossrefs

Formula

Triangle read by rows, A051731 * A051953^(n-k); where A051953^(n-k) = an infinite lower triangular matrix with A051953 (0, 1, 1, 2, 1, 4, 1, 4, 3, 6, 1, 8,...) in the main diagonal and the rest zeros. A051731 = inverse Mobius transform.