login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141679 Triangle of coefficients of the inverse of A058071. 2
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 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The row sums are {1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, ...}.
The inverse is a tridiagonal lower triangular matrix.
LINKS
FORMULA
A058071(n,m) = if(m <= n, Fibonacci(n - m + 1)*Fibonacci(m + 1), 0), t(n,m) = Fibonacci(n)*Inverse(A058071(n,m)).
EXAMPLE
{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}
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[%]
CROSSREFS
Cf. A058071.
As a sequence, quite similar to A136705. - N. J. A. Sloane, Dec 14 2014
Sequence in context: A327866 A336477 A190230 * A276254 A303300 A249865
KEYWORD
tabl,sign
AUTHOR
EXTENSIONS
Edited by N. J. A. Sloane, Jan 05 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 4 17:51 EDT 2024. Contains 372257 sequences. (Running on oeis4.)