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 A198295 #16 Jul 03 2020 14:55:05 %S A198295 1,0,1,0,1,1,0,0,2,1,0,1,1,3,1,0,1,2,3,4,1,0,0,4,4,6,5,1,0,1,2,9,8,10, %T A198295 6,1,0,1,3,9,17,15,15,7,1,0,0,6,9,24,30,26,21,8,1,0,1,3,18,26,51,51, %U A198295 42,28,9,1 %N A198295 Riordan array (1, x*(1+x)/(1-x^3)). %C A198295 Triangle T(n,k), read by rows, given by (0, 1, -1, -1, 2, -1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. %C A198295 Antidiagonals sums: see A159284. %D A198295 A. Luzón, D. Merlini, M. A. Morón, R. Sprugnoli, Complementary Riordan arrays, Discrete Applied Mathematics, 172 (2014) 75-87. %H A198295 Milan Janjic, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL19/Janjic/janjic73.html">Binomial Coefficients and Enumeration of Restricted Words</a>, Journal of Integer Sequences, 2016, Vol 19, #16.7.3 %F A198295 Sum_{k, 0<=k<=n} T(n,k) = A001590(n+2), n>0. %F A198295 Sum_{k, 0<=k<=n}T(n,k)*(-1)^(n-k) = A078056(n-1), n>0. %F A198295 T(n,n) = A000012(n), T(n+1,n) = A001477(n) = n, T(n+2,n) = A161680(n) = A000217(n-1); T(n+3,n) = A000125(n-1), n>=1. %F A198295 G.f.: (-1+x)*(1+x+x^2)/(-1+x^3+x*y+x^2*y). - _R. J. Mathar_, Aug 11 2015 %e A198295 Triangle begins: %e A198295 1 %e A198295 0, 1 %e A198295 0, 1, 1 %e A198295 0, 0, 2, 1 %e A198295 0, 1, 1, 3, 1 %e A198295 0, 1, 2, 3, 4, 1 %e A198295 0, 0, 4, 4, 6, 5, 1 %e A198295 0, 1, 2, 9, 8, 10, 6, 1 %e A198295 0, 1, 3, 9, 17, 15, 15, 7, 1 %Y A198295 Cf. Columns: A000007, A011655, A186731, A185395, A185292. %Y A198295 Cf. Diagonals: A000012, A001477, A161680, A000125. %K A198295 nonn,tabl %O A198295 0,9 %A A198295 _Philippe Deléham_, Jan 26 2012