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.
%I A141679 #9 Jun 05 2018 22:33:11
%S A141679 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,
%T A141679 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,
%U A141679 0,0,0,-1,-1,1
%N A141679 Triangle of coefficients of the inverse of A058071.
%C A141679 The row sums are {1, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, ...}.
%C A141679 The inverse is a tridiagonal lower triangular matrix.
%H A141679 G. C. Greubel, <a href="/A141679/b141679.txt">Rows n=1..100 of triangle, flattened</a>
%F A141679 A058071(n,m) = if(m <= n, Fibonacci(n - m + 1)*Fibonacci(m + 1), 0), t(n,m) = Fibonacci(n)*Inverse(A058071(n,m)).
%e A141679 {1},
%e A141679 {-1, 1},
%e A141679 {-1, -1, 1},
%e A141679 {0, -1, -1, 1},
%e A141679 {0, 0, -1, -1, 1},
%e A141679 {0, 0,0, -1, -1, 1},
%e A141679 {0, 0, 0, 0, -1, -1, 1},
%e A141679 {0, 0, 0, 0, 0, -1, -1, 1},
%e A141679 {0, 0, 0, 0, 0, 0, -1, -1, 1},
%e A141679 {0, 0, 0, 0, 0, 0, 0, -1, -1, 1},
%e A141679 {0, 0, 0, 0, 0, 0, 0, 0, -1, -1, 1}
%t A141679 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[%]
%Y A141679 Cf. A058071.
%Y A141679 As a sequence, quite similar to A136705. - _N. J. A. Sloane_, Dec 14 2014
%K A141679 tabl,sign
%O A141679 1,1
%A A141679 _Roger L. Bagula_ and _Gary W. Adamson_, Sep 07 2008
%E A141679 Edited by _N. J. A. Sloane_, Jan 05 2009