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 A193588 #18 Mar 02 2023 10:22:26
%S A193588 1,1,2,1,2,3,1,2,3,5,1,2,3,5,8,1,2,3,5,8,13,1,2,3,5,8,13,21,1,2,3,5,8,
%T A193588 13,21,34,1,2,3,5,8,13,21,34,55,1,2,3,5,8,13,21,34,55,89,1,2,3,5,8,13,
%U A193588 21,34,55,89,144,1,2,3,5,8,13,21,34,55,89,144,233
%N A193588 A Fibonacci triangle: T(n,k) = Fib(k+2) for 0 <= k <= n.
%C A193588 n-th row sum: A001911, Fib(n+3)-2;
%C A193588 n-th alternating row sum: A000045, F(n).
%C A193588 The augmentation (as defined at A193091) of A193588 is A193589.
%F A193588 a(n) = A115346(n) + 1. - _Filip Zaludek_, Nov 19 2016
%e A193588 First 5 rows of A193588:
%e A193588 1;
%e A193588 1, 2;
%e A193588 1, 2, 3;
%e A193588 1, 2, 3, 5;
%e A193588 1, 2, 3, 5, 8;
%t A193588 (See A193589, the augmentation of A193588.)
%t A193588 Table[Fibonacci[k+2],{n,0,20},{k,0,n}]//Flatten (* _Harvey P. Dale_, Nov 29 2017 *)
%t A193588 Module[{nn=15,fibs},fibs=Fibonacci[Range[2,nn]];Table[Take[fibs,n],{n,nn-1}]]// Flatten (* _Harvey P. Dale_, Mar 02 2023 *)
%Y A193588 Cf. A193588.
%K A193588 nonn,tabl
%O A193588 0,3
%A A193588 _Clark Kimberling_, Jul 31 2011