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 A141169 #19 Aug 24 2015 02:02:10 %S A141169 0,0,1,0,1,1,0,1,1,2,0,1,1,2,3,0,1,1,2,3,5,0,1,1,2,3,5,8,0,1,1,2,3,5, %T A141169 8,13,0,1,1,2,3,5,8,13,21,0,1,1,2,3,5,8,13,21,34,0,1,1,2,3,5,8,13,21, %U A141169 34,55,0,1,1,2,3,5,8,13,21,34,55,89,0,1,1,2,3,5,8,13,21,34,55,89,144,0,1,1,2,3,5,8,13,21 %N A141169 Triangle of Fibonacci numbers, read by rows: T(n,k) = A000045(k), 0<=k<=n. %C A141169 T(n,0) = A000004(n); T(n,n) = A000045(n); %C A141169 central terms: T(2*n,n) = A000045(n); %C A141169 sums of rows: Sum(T(n,k): 0<=k<=n) = A000071(n+2); %C A141169 alternating sums of rows: Sum(T(n,k)*(-1)^k: 0<=k<=n) = A119282(n); %C A141169 T(n,k) + T(n,n-k) = A094570(n,k). %H A141169 Reinhard Zumkeller, <a href="/A141169/b141169.txt">Rows n=0..125 of triangle, flattened</a> %o A141169 (Haskell) %o A141169 import Data.List (inits) %o A141169 a141169 n k = a141169_tabl !! n !! k %o A141169 a141169_row n = a141169_tabl !! n %o A141169 a141169_tabl = tail $ inits a000045_list %o A141169 a141169_list = concat $ a141169_tabl %o A141169 -- _Reinhard Zumkeller_, Aug 24 2015, Mar 21 2011 %Y A141169 Cf. A000045, A000004, A000071, A094570, A119282. %K A141169 nonn,tabl %O A141169 0,10 %A A141169 _Reinhard Zumkeller_, Mar 21 2011