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.

A127478 Triangle T(n,k) read by rows: matrix product A054523 * A054522.

Original entry on oeis.org

1, 2, 1, 3, 0, 2, 4, 2, 0, 2, 5, 0, 0, 0, 4, 6, 3, 4, 0, 0, 2, 7, 0, 0, 0, 0, 0, 6, 8, 4, 0, 4, 0, 0, 0, 4, 9, 0, 6, 0, 0, 0, 0, 0, 6, 10, 5, 0, 0, 8, 0, 0, 0, 0, 4, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 12, 6, 8, 6, 0, 4, 0, 0, 0, 0, 0, 4, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 14, 7, 0, 0, 0, 0, 12, 0, 0, 0
Offset: 1

Views

Author

Gary W. Adamson, Jan 15 2007

Keywords

Comments

If the two matrices A054523 and A054522 are commuted, the matrix product becomes A127477.

Examples

			First few rows of the triangle are:
.1;
.2, 1;
.3, 0, 2;
.4, 2, 0, 2;
.5, 0, 0, 0, 4;
.6, 3, 4, 0, 0, 2;
.7, 0, 0, 0, 0, 0, 6;
.8, 4, 0, 4, 0, 0, 0, 4;
....
		

Crossrefs

Programs

  • Maple
    A054522 := proc(n,k) if k = 1 then 1; elif n mod k = 0 then numtheory[phi](k) ; else 0 ; fi; end:
    A054523 := proc(n,k) if k = n then 1; elif n mod k = 0 then numtheory[phi](n/k) ; else 0 ; fi; end:
    A127478 := proc(n,k) add( A054523(n,j)*A054522(j,k), j=k..n) ; end: seq(seq( A127478(n,k),k=1..n),n=1..15) ;

Formula

T(n,k) = sum_{j=k..n} A054523(n,j) * A054522(j,k).
T(n,n) = A000010(n) (diagonal).
sum_{k=1..n} T(n,k) = A018804(n) (row sums).

Extensions

Converted comments to formulas, extended - R. J. Mathar, Sep 11 2009