The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Table of n, a(n) for n=0..13.
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
Adjacent sequences: A177596 A177597 A177598 * A177600 A177601 A177602
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 31 22:12 EDT 2024. Contains 373007 sequences. (Running on oeis4.)