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

 


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

%I #11 Aug 08 2018 22:16:48

%S 1,1,70,34650,58370761,254257625001,2393820329913000,

%T 43063879074705797700,1353425989195928500100361,

%U 69430476979743039562119157801,5512282735792717664890405885818130,648886597453482823172404492855676280150,109337364789335440628249746207373482901394961

%N Number of permutations of 4 copies of 1..n avoiding adjacent step pattern up, 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.

%K nonn

%O 0,3

%A _R. H. Hardin_, May 10 2010

%E a(8) from _Alois P. Heinz_, Nov 01 2013

%E a(0), a(9)-a(12) from _Alois P. Heinz_, Aug 08 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 20:46 EDT 2024. Contains 376140 sequences. (Running on oeis4.)