login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A177558 Number of permutations of 2 copies of 1..n avoiding adjacent step pattern up, up, up. 3
1, 1, 6, 90, 2401, 101761, 6291216, 534649500, 59805912601, 8519381695801, 1505829663622626, 323403835613234310, 82950935886564603001, 25045332571083387933241, 8792814340394735774002236, 3551704765357254157594658520, 1635557840926288462033032891601 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

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. A177564, A177574, A177594.

Sequence in context: A147630 A221097 A177584 * A177580 A177587 A177585

Adjacent sequences:  A177555 A177556 A177557 * A177559 A177560 A177561

KEYWORD

nonn

AUTHOR

R. H. Hardin, May 10 2010

EXTENSIONS

a(12)-a(15) from Alois P. Heinz, Nov 01 2013

a(0), a(16) 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 October 21 11:51 EDT 2021. Contains 348150 sequences. (Running on oeis4.)