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.

A143153 Triangle read by rows, A054525 * (A020639 * 0^(n-k)), 1<=k<=n.

Original entry on oeis.org

1, -1, 2, -1, 0, 3, 0, -2, 0, 2, -1, 0, 0, 0, 5, 1, -2, -3, 0, 0, 2, -1, 0, 0, 0, 0, 0, 7, 0, 0, 0, -2, 0, 0, 0, 2, 0, 0, -3, 0, 0, 0, 0, 0, 3, 1, -2, 0, 0, -5, 0, 0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 0, 2, 0, -2, 0, -2, 0, 0, 0, 0, 0, 2, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 1, -2, 0, 0, 0, 0, -7, 0, 0, 0, 0, 0, 0, 2
Offset: 1

Views

Author

Gary W. Adamson & Mats Granvik, Jul 27 2008

Keywords

Comments

Right border = A020639, Lpf(n): (1, 2, 3, 2, 5, 2, 7, 2, 3, 2, 11,...).
Left border = mu(n), A008683: (1, -1, -1, 0, -1, 1, -1,...).
Row sums = a signed version of A097945: (1, -1, -2, 0, -4, 2, -6,...) such that parity = (+) iff mu(n) = +.

Examples

			First few rows of the triangle =
1;
-1, 2;
-1, 0, 3;
0, -2, 0, 2;
-1, 0, 0, 0, 5;
1, -2, -3, 0, 0, 2;
-1, 0, 0, 0, 0, 0, 7;
0, 0, 0, -2, 0, 0, 0, 2;
0, 0, -3, 0, 0, 0, 0, 0, 3;
1, -2, 0, 0, -5, 0, 0, 0, 0, 2;
-1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11;
0, 2, 0, -2, 0, -2, 0, 0, 0, 0, 0, 2;
...
		

Crossrefs

Formula

Triangle read by rows, A054525 * (A020639 * 0^(n-k)), 1<=k<=n; where A020639 = Lpf(n): (1, 2, 3, 2, 5, 2, 7, 2, 3, 2,...) and A054525 = the Mobius transform.