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.

A127173 T(n,k) = A007427(n/k) if k divides n, T(n,k) = 0 otherwise.

Original entry on oeis.org

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

Views

Author

Gary W. Adamson, Jan 06 2007

Keywords

Examples

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

Crossrefs

Row sums are A008683.
Column 1 is A007427.

Programs

  • PARI
    \\ here b(n) is A007427(n).
    b(n)={sumdiv(n, d, moebius(d) * moebius(n/d))}
    T(n,k)={if(n%k==0, b(n/k), 0)} \\ Andrew Howroyd, Feb 20 2022

Formula

Square of A054525 as lower triangular matrix.
A007431(n) = Sum_{k=1, n} k*T(n,k).
A007428(n) = Sum_{k=1..n} mu(k)*T(n,k).

Extensions

Missing a(10)-a(14) and a(56) and beyond from Andrew Howroyd, Feb 20 2022