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

 

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

%I #11 Aug 08 2018 20:58:03

%S 1,1,70,34650,63063000,305540235000,3246670537110000,

%T 66471564122981413201,2389990877540259562671201,

%U 140752914446323991227575378870,12859891096524517937525915077936650,1745170838822213670914740929271388502150,339448526227710036385042441267361806617147750

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

%Y Cf. A014608.

%K nonn

%O 0,3

%A _R. H. Hardin_, May 10 2010

%E a(9)-a(12) 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 04:02 EDT 2024. Contains 374463 sequences. (Running on oeis4.)