A177555 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A177555

Number of permutations of 2 copies of 1..n avoiding adjacent step pattern up, up.

0

1, 1, 6, 67, 1345, 42540, 1954681, 123179785, 10202958366, 1075213876195, 140503060278001, 22298495343474372, 4224949686497139601, 942067522308032112721, 244201603555824428994486, 72820161285112813781838787, 24752401241200431437146873345

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

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

Mingjia Yang, 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

Sequence in context: A230342 A239301 A121958 * A054746 A116005 A297435

Adjacent sequences: A177552 A177553 A177554 * A177556 A177557 A177558

KEYWORD

nonn

AUTHOR

R. H. Hardin, May 10 2010

EXTENSIONS

a(12)-a(15) from Alois P. Heinz, Oct 22 2013

a(0), a(16) from Alois P. Heinz, Aug 08 2018

STATUS

approved