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 A063967 #48 Apr 24 2022 09:15:27
%S A063967 1,1,1,2,3,1,3,7,5,1,5,15,16,7,1,8,30,43,29,9,1,13,58,104,95,46,11,1,
%T A063967 21,109,235,271,179,67,13,1,34,201,506,705,591,303,92,15,1,55,365,
%U A063967 1051,1717,1746,1140,475,121,17,1,89,655,2123,3979,4759,3780,2010,703,154,19,1
%N A063967 Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
%H A063967 Reinhard Zumkeller, <a href="/A063967/b063967.txt">Rows n = 0..120 of triangle, flattened</a>
%H A063967 E. Deutsch, L. Ferrari and S. Rinaldi, <a href="http://dx.doi.org/10.1016/j.aam.2004.05.002">Production Matrices</a>, Advances in Mathematics, 34 (2005) pp. 101-122.
%H A063967 Emanuele Munarini, <a href="https://doi.org/10.1515/puma-2015-0028">A generalization of André-Jeannin's symmetric identity</a>, Pure Mathematics and Applications (2018) Vol. 27, No. 1, 98-118.
%F A063967 G.f.: 1/(1-x*(1+x)*(1+y)). - _Vladeta Jovovic_, Oct 11 2003
%F A063967 Riordan array (1/(1-x-x^2), x(1+x)/(1-x-x^2)). The inverse of the signed version (1/(1+x-x^2),x(1-x)/(1+x-x^2)) is abs(A091698). - _Paul Barry_, Jun 10 2005
%F A063967 T(n, k) = Sum_{j=0..n} C(j, n-j)C(j, k). - _Paul Barry_, Nov 09 2005
%F A063967 Diagonal sums are A002478. - _Paul Barry_, Nov 09 2005
%F A063967 A026729*A007318 as infinite lower triangular matrices. - _Philippe Deléham_, Dec 11 2008
%F A063967 Central coefficients T(2*n,n) are A137644. - _Paul Barry_, Apr 15 2010
%F A063967 Product of Riordan arrays (1, x(1+x))*(1/(1-x), x/(1-x)), that is, A026729*A007318. - _Paul Barry_, Mar 14 2011
%F A063967 Triangle T(n,k), read by rows, given by (1,1,-1,0,0,0,0,0,0,0,...) DELTA (1,0,0,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938. - _Philippe Deléham_, Nov 12 2011
%e A063967 T(3,1) = T(2,1) + T(1,1) + T(2,0) + T(1,0) = 3 + 1 + 2 + 1 = 7.
%e A063967 Triangle begins:
%e A063967 1,
%e A063967 1, 1,
%e A063967 2, 3, 1,
%e A063967 3, 7, 5, 1,
%e A063967 5, 15, 16, 7, 1,
%e A063967 8, 30, 43, 29, 9, 1,
%e A063967 13, 58, 104, 95, 46, 11, 1,
%e A063967 21, 109, 235, 271, 179, 67, 13, 1,
%e A063967 34, 201, 506, 705, 591, 303, 92, 15, 1
%t A063967 T[n_, k_] := Sum[Binomial[j, n - j]*Binomial[j, k], {j, 0, n}]; Table[T[n, k], {n, 0, 10}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Oct 11 2017, after _Paul Barry_ *)
%t A063967 (* Function RiordanSquare defined in A321620. *)
%t A063967 RiordanSquare[1/(1 - x - x^2), 11] // Flatten (* _Peter Luschny_, Nov 27 2018 *)
%o A063967 (Haskell)
%o A063967 a063967_tabl = [1] : [1,1] : f [1] [1,1] where
%o A063967 f us vs = ws : f vs ws where
%o A063967 ws = zipWith (+) ([0] ++ us ++ [0]) $
%o A063967 zipWith (+) (us ++ [0,0]) $ zipWith (+) ([0] ++ vs) (vs ++ [0])
%o A063967 -- _Reinhard Zumkeller_, Apr 17 2013
%Y A063967 Row sums are A002605.
%Y A063967 Columns include: A000045(n+1), A023610(n-1).
%Y A063967 Main diagonal: A000012, a(n, n-1) = A005408(n-1).
%Y A063967 Matrix inverse: A091698, matrix square: A091700.
%Y A063967 Cf. A321620.
%Y A063967 Sum_{k=0..n} x^k*T(n,k) is (-1)^n*A057086(n) (x=-11), (-1)^n*A057085(n+1) (x=-10), (-1)^n*A057084(n) (x=-9), (-1)^n*A030240(n) (x=-8), (-1)^n*A030192(n) (x=-7), (-1)^n*A030191(n) (x=-6), (-1)^n*A001787(n+1) (x=-5), A000748(n) (x=-4), A108520(n) (x=-3), A049347(n) (x=-2), A000007(n) (x=-1), A000045(n) (x=0), A002605(n) (x=1), A030195(n+1) (x=2), A057087(n) (x=3), A057088(n) (x=4), A057089(n) (x=5), A057090(n) (x=6), A057091(n) (x=7), A057092(n) (x=8), A057093(n) (x=9). - _Philippe Deléham_, Nov 03 2006
%K A063967 easy,nonn,tabl
%O A063967 0,4
%A A063967 _Henry Bottomley_, Sep 05 2001