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.

A127505 Triangle T(n,k) = mobius(n/k)*phi(k) if k|n, otherwise T(n,k)=0; 1<=k<=n.

Original entry on oeis.org

1, -1, 1, -1, 0, 2, 0, -1, 0, 2, -1, 0, 0, 0, 4, 1, -1, -2, 0, 0, 2, -1, 0, 0, 0, 0, 0, 6, 0, 0, 0, -2, 0, 0, 0, 4, 0, 0, -2, 0, 0, 0, 0, 0, 6, 1, -1, 0, 0, -4, 0, 0, 0, 0, 4, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 1, 0, -2, 0, -2, 0, 0
Offset: 1

Views

Author

Gary W. Adamson, Jan 17 2007

Keywords

Examples

			First few rows of the triangle are:
1;
-1, 1;
-1, 0, 2;
0, -1, 0, 2;
-1, 0, 0, 0, 4;
1, -1, -2, 0, 0, 2;
...
		

Crossrefs

Cf. A051731, A000010 (diagonal n=k), A007431 (row sums), A008683 (column k=1).

Formula

T(n,k) = sum_{j=k..n} A054525(n,j)*A130207(j,k), 1<=k<=n.