login

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”).

A177615
Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up, up, up.
2
1, 1, 20, 1680, 369600, 168168000, 137127810959, 182138398520387, 367988956112888200, 1074073326771101149080, 4350318942513425384777400, 23673963203663687592089088600, 168569155472096397352266896207243, 1536148007688582239667327040442799059
OFFSET
0,3
LINKS
Mingjia Yang and Doron Zeilberger, Increasing Consecutive Patterns in Words, arXiv:1805.06077 [math.CO], 2018.
Mingjia Yang, An experimental walk in patterns, partitions, and words, Ph. D. Dissertation, Rutgers University (2020).
CROSSREFS
Cf. A014606.
Sequence in context: A177629 A177630 A177294 * A177616 A177295 A177635
KEYWORD
nonn
AUTHOR
R. H. Hardin, May 10 2010
EXTENSIONS
a(10)-a(13) from Alois P. Heinz, Aug 08 2018
STATUS
approved