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 A199512 #23 Aug 01 2017 11:47:51 %S A199512 1,1,2,2,3,5,3,5,8,13,5,8,13,21,34,8,13,21,34,55,89,13,21,34,55,89, %T A199512 144,233,21,34,55,89,144,233,377,610,34,55,89,144,233,377,610,987, %U A199512 1597,55,89,144,233,377,610,987,1597,2584,4181 %N A199512 Triangle T(n,k) = Fibonacci(n+k+1), related to A000045 (Fibonacci numbers). %H A199512 Michel Marcus, <a href="/A199512/b199512.txt">Rows n=0..50 of triangle, flattened</a> %H A199512 László Németh, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL20/Nemeth/nemeth2.html">On the Binomial Interpolated Triangles</a>, Journal of Integer Sequences, Vol. 20 (2017), Article 17.7.8. See p. 15. %F A199512 T(n,k) = T(n,k-1) + T(n-1,k-1) = T(n-1,k-1) + T(n-1,k). %F A199512 T(n,0) = Fibonacci(n+1) = A000045(n+1). %e A199512 Triangle begins : %e A199512 1 %e A199512 1, 2 %e A199512 2, 3, 5 %e A199512 3, 5, 8, 13 %e A199512 5, 8, 13, 21, 34 %e A199512 8, 13, 21, 34, 55, 89 %o A199512 (PARI) T(n, k) = fibonacci(n+k+1); %o A199512 tabl(nn) = for (n=0, nn, for (k=0, n, print1(T(n, k), ", ")); print); \\ _Michel Marcus_, Aug 01 2017 %Y A199512 Cf. A000045, A199334. %Y A199512 Rows sums : A096140, Diagonal sums : A128620. %K A199512 easy,nonn,tabl %O A199512 0,3 %A A199512 _Philippe Deléham_, Nov 07 2011 %E A199512 More terms from _Michel Marcus_, Aug 01 2017