login
Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up, up.
2

%I #19 Mar 12 2021 19:29:56

%S 1,1,20,1680,369600,166923119,134612399509,176468898415460,

%T 351456009607660440,1010384984894493146400,4028532188816344883922611,

%U 21572165225621811583520157531,151100918612288209338643024889160,1354217120536797195675961944817053840

%N Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up, up.

%H Mingjia Yang and Doron Zeilberger, <a href="https://arxiv.org/abs/1805.06077">Increasing Consecutive Patterns in Words</a>, arXiv:1805.06077 [math.CO], 2018.

%H Mingjia Yang, <a href="https://doi.org/10.7282/t3-d9z1-aw94">An experimental walk in patterns, partitions, and words</a>, Ph. D. Dissertation, Rutgers University (2020).

%Y Cf. A014606.

%Y Cf. A177596, A177615.

%K nonn

%O 0,3

%A _R. H. Hardin_, May 10 2010

%E a(10) from _Alois P. Heinz_, Nov 01 2013

%E a(11)-a(13) from _Alois P. Heinz_, Aug 08 2018