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.

A155726 Production matrix for Fibonacci numbers, read by row.

Original entry on oeis.org

0, 1, 2, -1, 1, 3, 0, -1, 1, 4, 0, 0, -1, 1, 5, 0, 0, 0, -1, 1, 6, 0, 0, 0, 0, -1, 1, 7, 0, 0, 0, 0, 0, -1, 1, 8, 0, 0, 0, 0, 0, 0, -1, 1, 9, 0, 0, 0, 0, 0, 0, 0, -1
Offset: 0

Views

Author

Paul Barry, Jan 25 2009

Keywords

Comments

The matrix generated by this matrix has row sums F(n+1).

Examples

			Matrix begins
  0, 1,
  2, -1, 1,
  3, 0, -1, 1,
  4, 0, 0, -1, 1,
  5, 0, 0, 0, -1, 1,
  6, 0, 0, 0, 0, -1, 1,
  7, 0, 0, 0, 0, 0, -1, 1,
  8, 0, 0, 0, 0, 0, 0, -1, 1,
  9, 0, 0, 0, 0, 0, 0, 0, -1, 1
The row augmented triangular matrix
  1,
  0, 1,
  2, -1, 1,
  3, 0, -1, 1,
  4, 0, 0, -1, 1,
  5, 0, 0, 0, -1, 1,
  6, 0, 0, 0, 0, -1, 1,
  7, 0, 0, 0, 0, 0, -1, 1,
  8, 0, 0, 0, 0, 0, 0, -1, 1,
  9, 0, 0, 0, 0, 0, 0, 0, -1, 1
has row sums 0^n+n. Its inverse has row sums (n+1)(2-n)/2 or A080956.
This is the matrix
    1,
    0, 1,
   -2, 1, 1,
   -5, 1, 1, 1,
   -9, 1, 1, 1, 1,
  -14, 1, 1, 1, 1, 1,
  -20, 1, 1, 1, 1, 1, 1,
  -27, 1, 1, 1, 1, 1, 1, 1,
  -35, 1, 1, 1, 1, 1, 1, 1, 1
with first column (n+2)(1-n)/2.
		

Crossrefs