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



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A177555 Number of permutations of 2 copies of 1..n avoiding adjacent step pattern up, up. 0


%S 1,1,6,67,1345,42540,1954681,123179785,10202958366,1075213876195,

%T 140503060278001,22298495343474372,4224949686497139601,

%U 942067522308032112721,244201603555824428994486,72820161285112813781838787,24752401241200431437146873345

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

%H Mingjia Yang, Doron Zeilberger, <a href="https://arxiv.org/abs/1805.06077">Increasing Consecutive Patterns in Words</a>, arXiv:1805.06077 [math.CO], 2018.

%H Mingjia Yang, <a href="https://doi.org/10.7282/t3-d9z1-aw94">An experimental walk in patterns, partitions, and words</a>, Ph. D. Dissertation, Rutgers University (2020).

%K nonn

%O 0,3

%A _R. H. Hardin_, May 10 2010

%E a(12)-a(15) from _Alois P. Heinz_, Oct 22 2013

%E a(0), a(16) from _Alois P. Heinz_, Aug 08 2018

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 December 2 17:59 EST 2021. Contains 349445 sequences. (Running on oeis4.)