Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Oct 28 2014 20:49:30
%S 0,1,1,3,9,34,159,853,5249,36369,279711,2367212,21854625,218570717,
%T 2354163631,27167018427,334407123969,4373595961678,60565476185919,
%U 885304614118777,13621870369734689,220074660203753961,3724832321188825551,65909583942401516528
%N Number of permutations of [n] with every alternating run of length less than 3 in which the last alternating run has length 1.
%H Alois P. Heinz, <a href="/A246013/b246013.txt">Table of n, a(n) for n = 0..300</a>
%H Ira M. Gessel, Yan Zhuang, <a href="http://arxiv.org/abs/1408.1886">Counting permutations by alternating descents</a>, 2014. See c(n).
%K nonn
%O 0,4
%A _N. J. A. Sloane_, Aug 11 2014
%E More terms from _Alois P. Heinz_, Oct 28 2014