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 #11 Aug 08 2018 22:16:48
%S 1,1,70,34650,58370761,254257625001,2393820329913000,
%T 43063879074705797700,1353425989195928500100361,
%U 69430476979743039562119157801,5512282735792717664890405885818130,648886597453482823172404492855676280150,109337364789335440628249746207373482901394961
%N Number of permutations of 4 copies of 1..n avoiding adjacent step pattern up, up, up.
%H Mingjia Yang, Doron Zeilberger, <a href="https://arxiv.org/abs/1805.06077">Increasing Consecutive Patterns in Words</a>, arXiv:1805.06077 [math.CO], 2018.
%K nonn
%O 0,3
%A _R. H. Hardin_, May 10 2010
%E a(8) from _Alois P. Heinz_, Nov 01 2013
%E a(0), a(9)-a(12) from _Alois P. Heinz_, Aug 08 2018