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!)
A177605 Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up, up. 0
1, 1, 20, 1680, 369600, 166923119, 134612399509, 176468898415460, 351456009607660440, 1010384984894493146400, 4028532188816344883922611, 21572165225621811583520157531, 151100918612288209338643024889160, 1354217120536797195675961944817053840 (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: A177634 A177293 A266738 * A177606 A177617 A177629

Adjacent sequences:  A177602 A177603 A177604 * A177606 A177607 A177608

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 16:14 EST 2019. Contains 319307 sequences. (Running on oeis4.)