login
Number of alternating permutations on 2n letters that avoid a certain pattern of length 4 (see Lewis, 2012, Appendix, for precise definition).
0

%I #11 Feb 17 2018 10:48:36

%S 1,5,42,453,5651,77498,1135828,17485309,279540684

%N Number of alternating permutations on 2n letters that avoid a certain pattern of length 4 (see Lewis, 2012, Appendix, for precise definition).

%H J. B. Lewis, <a href="https://dspace.mit.edu/handle/1721.1/73444">Pattern Avoidance for Alternating Permutations and Reading Words of Tableaux</a>, Ph. D. Dissertation, Department of Mathematics, MIT, 2012.

%Y Cf. A181197, A217799-A217830.

%K nonn,more

%O 1,2

%A _N. J. A. Sloane_, Oct 12 2012

%E a(7)-a(9) from _Lars Blomberg_, Feb 17 2018