|
%I #11 Feb 17 2018 10:48:45
%S 1,5,61,744,10329,157586,2581722,44710952,809508414
%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 13 2012
%E a(7)-a(9) from _Lars Blomberg_, Feb 17 2018
|
