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 A094718 #42 Oct 09 2020 09:08:30
%S A094718 0,1,0,1,1,0,1,2,1,0,1,2,2,1,0,1,2,3,4,1,0,1,2,3,5,4,1,0,1,2,3,6,8,8,
%T A094718 1,0,1,2,3,6,9,13,8,1,0,1,2,3,6,10,18,21,16,1,0,1,2,3,6,10,19,27,34,
%U A094718 16,1,0,1,2,3,6,10,20,33,54,55,32,1,0,1,2,3,6,10,20,34,61,81,89,32,1
%N A094718 Array T read by antidiagonals: T(n,k) is the number of involutions avoiding 132 and 12...k.
%C A094718 Also, number of paths along a corridor with width k, starting from one side (from H. Bottomley's comment in A061551).
%C A094718 Rows converge to binomial(n,floor(n/2)) (A001405).
%C A094718 Note that the rows and columns start at 1, which for example obscures the fact that the first row refers to A000007 and not to A000004. A better choice is the indexing 0 <= k and 0 <= n. The Maple program below uses this indexing and builds only on the roots of -1. - _Peter Luschny_, Sep 17 2020
%H A094718 Shaun V. Ault and Charles Kicey, <a href="http://dx.doi.org/10.1016/j.disc.2014.05.020">Counting paths in corridors using circular Pascal arrays</a>, Discrete Mathematics, Volume 332, October 2014, Pages 45-54.
%H A094718 Nachum Dershowitz, <a href="https://arxiv.org/abs/2006.06516">Between Broadway and the Hudson</a>, arXiv:2006.06516 [math.CO], 2020.
%H A094718 Robert Dutton Fray and David Paul Roselle, <a href="https://projecteuclid.org/download/pdf_1/euclid.pjm/1102970745">Weighted lattice paths</a>, Pacific Journal of Mathematics, 37(1) (1971), 85-96.
%H A094718 O. Guibert and T. Mansour, <a href="http://www.mat.univie.ac.at/~slc/wpapers/s48guimans.html">Restricted 132-involutions</a>, Séminaire Lotharingien de Combinatoire, B48a (2002), 23 pp.
%H A094718 T. Mansour, <a href="https://arxiv.org/abs/math/0302014">Restricted even permutations and Chebyshev polynomials</a>, arXiv:math/0302014 [math.CO], 2003.
%F A094718 G.f. for k-th row: 1/(x*U(k, 1/(2*x))) * Sum_{j=0..k-1} U(j, 1/(2*x)), with U(k, x) the Chebyshev polynomials of second kind. [Clarified by _Jean-François Alcover_, Nov 17 2018]
%F A094718 T(n, k) = (1/(n+1))*Sum_{j=1..n, j odd} (2 + [j, n]) * [j, n]^k where [j, n] := (-1)^(j/(n+1)) - (-1)^((n-j+1)/(n+1)). - _Peter Luschny_, Sep 17 2020
%e A094718 Array begins
%e A094718 0 0 0 0 0 0 0 0 0 0 ...
%e A094718 1 1 1 1 1 1 1 1 1 1 ...
%e A094718 1 2 2 4 4 8 8 16 16 32 ...
%e A094718 1 2 3 5 8 13 21 34 55 89 ...
%e A094718 1 2 3 6 9 18 27 54 81 162 ...
%e A094718 1 2 3 6 10 19 33 61 108 197 ...
%e A094718 1 2 3 6 10 20 34 68 116 232 ...
%e A094718 1 2 3 6 10 20 35 69 124 241 ...
%e A094718 1 2 3 6 10 20 35 70 125 250 ...
%e A094718 1 2 3 6 10 20 35 70 126 251 ...
%e A094718 ...
%p A094718 X := (j, n) -> (-1)^(j/(n+1)) - (-1)^((n-j+1)/(n+1)):
%p A094718 R := n -> select(k -> type(k, odd), [$(1..n)]):
%p A094718 T := (n, k) -> add((2 + X(j,n))*X(j,n)^k, j in R(n))/(n+1):
%p A094718 seq(lprint([n], seq(simplify(T(n, k)), k=0..10)), n=0..9); # _Peter Luschny_, Sep 17 2020
%t A094718 U = ChebyshevU;
%t A094718 m = maxExponent = 14;
%t A094718 row[1] = Array[0&, m];
%t A094718 row[k_] := 1/(x U[k, 1/(2x)])*Sum[U[j, 1/(2x)], {j, 0, k-1}] + O[x]^m // CoefficientList[#, x]& // Rest;
%t A094718 T = Table[row[n], {n, 1, m}];
%t A094718 Table[T[[n-k+1, k]], {n, 1, m-1}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Nov 17 2018 *)
%Y A094718 Rows 3-8 are A016116, A000045, A038754, A028495, A030436, A061551.
%Y A094718 Main diagonal is A014495, antidiagonal sums are in A094719.
%Y A094718 Cf. A080934 (permutations).
%K A094718 nonn,tabl
%O A094718 1,8
%A A094718 _Ralf Stephan_, May 23 2004