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!)
A177637 Number of permutations of 4 copies of 1..n avoiding adjacent step pattern up, up. 0
1, 1, 70, 20251, 19387201, 47213021620, 246331792085401, 2443003220126326201, 42187963284758541226270, 1186523552401322210323083451, 51563739785315001241213870794001, 3318691262415781291317711866423813020, 305473715050119138647351857854838738832401 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

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

CROSSREFS

Sequence in context: A007099 A004109 A002829 * A145410 A177638 A274646

Adjacent sequences:  A177634 A177635 A177636 * A177638 A177639 A177640

KEYWORD

nonn

AUTHOR

R. H. Hardin, May 10 2010

EXTENSIONS

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

a(0), a(9)-a(12) 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.)