A141679 Triangle of coefficients of the inverse of A058071.

1, -1, 1, -1, -1, 1, 0, -1, -1, 1, 0, 0, -1, -1, 1, 0, 0, 0, -1, -1, 1, 0, 0, 0, 0, -1, -1, 1, 0, 0, 0, 0, 0, -1, -1, 1, 0, 0, 0, 0, 0, 0, -1, -1, 1, 0, 0, 0, 0, 0, 0, 0, -1, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, 1

Offset: 1

Author

Roger L. Bagula and Gary W. Adamson, Sep 07 2008

Keywords

• tabl
• sign

Comments

The row sums are {1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, ...}.

The inverse is a tridiagonal lower triangular matrix.

Examples

			{1},
{-1, 1},
{-1, -1, 1},
{0, -1, -1, 1},
{0, 0, -1, -1, 1},
{0, 0,0, -1, -1, 1},
{0, 0, 0, 0, -1, -1, 1},
{0, 0, 0, 0, 0, -1, -1, 1},
{0, 0, 0, 0, 0, 0, -1, -1, 1},
{0, 0, 0, 0, 0, 0, 0, -1, -1, 1},
{0, 0, 0, 0, 0, 0, 0, 0, -1, -1, 1}
		

Links

• G. C. Greubel, Rows n=1..100 of triangle, flattened

Crossrefs

Cf. A058071.

As a sequence, quite similar to A136705. - N. J. A. Sloane, Dec 14 2014

Programs

Mathematica

Clear[t, n, m, M] (*A058071*) t[n_, m_] = If[m <= n, Fibonacci[n - m + 1]*Fibonacci[m + 1], 0]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%]; M = Inverse[Table[Table[t[n, m], {m, 0, 10}], {n, 0, 10}]]; Table[Table[Fibonacci[n]*M[[n, m]], {m, 1, n}], {n, 1, 11}]; Flatten[%]

Formula

A058071(n,m) = if(m <= n, Fibonacci(n - m + 1)*Fibonacci(m + 1), 0), t(n,m) = Fibonacci(n)*Inverse(A058071(n,m)).

Extensions

Edited by N. J. A. Sloane, Jan 05 2009