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!)
A177615 Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up, up, up. 0
1, 1, 20, 1680, 369600, 168168000, 137127810959, 182138398520387, 367988956112888200, 1074073326771101149080, 4350318942513425384777400, 23673963203663687592089088600, 168569155472096397352266896207243, 1536148007688582239667327040442799059 (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

Cf. A014606.

Sequence in context: A177629 A177630 A177294 * A177616 A177295 A177635

Adjacent sequences:  A177612 A177613 A177614 * A177616 A177617 A177618

KEYWORD

nonn

AUTHOR

R. H. Hardin, May 10 2010

EXTENSIONS

a(10)-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 16 21:37 EST 2019. Contains 319206 sequences. (Running on oeis4.)