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

A177599
Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up.
0
1, 1, 20, 1680, 347279, 145417911, 108103451700, 130235191847880, 237916352264650149, 626620767478218488341, 2286998940761680215812180, 11203494211631147331264432480, 71758642346800717617629677669619, 587889139521679290927189491977855371
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: A177631 A177292 A266737 * A177600 A177607 A177612
KEYWORD
nonn
AUTHOR
R. H. Hardin, May 10 2010
EXTENSIONS
a(10) from Alois P. Heinz, Nov 01 2013
a(11)-a(13) from Alois P. Heinz, Aug 08 2018
STATUS
approved