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.

A143255 Triangle read by rows, A128407 * A126988; 1<=k<=n.

Original entry on oeis.org

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

Views

Author

Gary W. Adamson, Aug 02 2008

Keywords

Comments

Left border = A055615: (1, -2, -3, 0, -5, 6, -7,...).
Right border = A008683, mu(n).
Row sums = A063441: (1, -3, -4, 0, -6, 12, 8,...).

Examples

			Triangle begins:
  1;
  -2, -1;
  -3, 0, -1;
  0, 0, 0, 0;
  -5, 0, 0, 0, -1;
  6, 3, 2, 0, 0, 1;
  -7, 0, 0, 0, 0, 0, -1;
  0, 0, 0, 0, 0, 0, 0, 0;
  0, 0, 0, 0, 0, 0, 0, 0, 0;
  10, 5, 0, 0, 2, 0, 0, 0, 0, 1;
  ...
		

Crossrefs

Programs

  • Mathematica
    t[n_, m_] = MoebiusMu[n]*If[m == 1, n, If[Mod[n, m] == 0, n/m, 0]]; Table[t[n, m], {n, 1, 14}, {m, 1, n}] // Flatten (* Roger L. Bagula, Sep 06 2008 *)

Formula

Triangle read by rows, A128407 * A126988; 1<=k<=n.
t(n,m) = MoebiusMu(n) * A126988(n,m); t(n,m) = MoebiusMu(n) * if(m == 1, n, if(n mod m == 0, n/m, 0)). - Roger L. Bagula, Sep 06 2008