login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094718 Array T read by antidiagonals: T(n,k) = number of involutions avoiding 132 and 12...k. 11

%I

%S 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 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 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 Array T read by antidiagonals: T(n,k) = number of involutions avoiding 132 and 12...k.

%C Also, number of paths along a corridor with width k, starting from one side (from H. Bottomley's comment in A061551).

%C Rows converge to C(n,[n/2]) (A001405).

%H 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 T. Mansour, <a href="http://arXiv.org/abs/math.CO/0302014">Restricted even permutations and Chebyshev polynomials</a>, arXiv:math/0302014 [math.CO], 2003.

%F G.f. for k-th row: 1/(xU(k, 1/2x)) * Sum[j=0..k-1, U(j, 1/2x)], with U(k, x) the Chebyshev polynomials of second kind. [Probably "1/2x" is intended to mean "x/2". - _N. J. A. Sloane_, Dec 20 2008]

%e 0 0 0 0 0 0 0 0 0 0

%e 1 1 1 1 1 1 1 1 1 1

%e 1 2 2 4 4 8 8 16 16 32

%e 1 2 3 5 8 13 21 34 55 89

%e 1 2 3 6 9 18 27 54 81 162

%e 1 2 3 6 10 19 33 61 108 197

%e 1 2 3 6 10 20 34 68 116 232

%e 1 2 3 6 10 20 35 69 124 241

%e 1 2 3 6 10 20 35 70 125 250

%e 1 2 3 6 10 20 35 70 126 251

%Y Rows 3-8 are A016116, A000045, A038754, A028495, A030436, A061551.

%Y Main diagonal is A014495, antidiagonal sums are in A094719.

%Y Cf. A080934 (permutations).

%K nonn,tabl

%O 1,8

%A _Ralf Stephan_, May 23 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 12:40 EST 2018. Contains 317272 sequences. (Running on oeis4.)