|
%I #17 Mar 12 2021 19:30:59
%S 1,1,20,1680,369600,168168000,137127810959,182138398520387,
%T 367988956112888200,1074073326771101149080,4350318942513425384777400,
%U 23673963203663687592089088600,168569155472096397352266896207243,1536148007688582239667327040442799059
%N Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, 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, A177605.
%K nonn
%O 0,3
%A _R. H. Hardin_, May 10 2010
%E a(10)-a(13) from _Alois P. Heinz_, Aug 08 2018
|
