login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A177596 Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up. 0
1, 1, 20, 1109, 149777, 40505320, 19324787629, 14885613436177, 17346023517866756, 29095672934852234945, 67554301929824585326841, 210353969049597164741983000, 855886755812900060235077981449, 4452236180954942685194928540509281 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..13.

Mingjia Yang, Doron Zeilberger, Increasing Consecutive Patterns in Words, arXiv:1805.06077 [math.CO], 2018.

CROSSREFS

Sequence in context: A006427 A072962 A224125 * A210835 A002305 A091535

Adjacent sequences:  A177593 A177594 A177595 * A177597 A177598 A177599

KEYWORD

nonn

AUTHOR

R. H. Hardin, May 10 2010

EXTENSIONS

a(10) from Alois P. Heinz, Oct 22 2013

a(0), 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 15 18:52 EST 2019. Contains 319170 sequences. (Running on oeis4.)