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!)
A321059 Number of ordered pairs (p,q) of permutations of [n] with equal up-down signatures and p(1)=q(1)=3. 2

%I

%S 2,8,64,852,17008,467696,16860608,769534688,43316046592,2945846638464,

%T 238048843712512,22542120635302912,2472277850712350720,

%U 310880199760083564032,44429722692959679590400,7161345941202962487965696,1292988538929694918729072640

%N Number of ordered pairs (p,q) of permutations of [n] with equal up-down signatures and p(1)=q(1)=3.

%H Alois P. Heinz, <a href="/A321059/b321059.txt">Table of n, a(n) for n = 3..110</a>

%e a(3) = 2: (312,312), (321,321).

%e a(4) = 8: (3124,3124), (3142,3142), (3142,3241), (3214,3214), (3241,3142), (3241,3241), (3412,3412), (3421,3421).

%p b:= proc(u, o, h) option remember; `if`(u+o=0, 1,

%p add(add(b(u-j, o+j-1, h+i-1), i=1..u+o-h), j=1..u)+

%p add(add(b(u+j-1, o-j, h-i), i=1..h), j=1..o))

%p end:

%p a:= n-> (k-> b(k-1, n-k, n-k))(3):

%p seq(a(n), n=3..20);

%Y Column k=3 of A262372.

%K nonn

%O 3,1

%A _Alois P. Heinz_, Oct 26 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 May 28 13:05 EDT 2022. Contains 354115 sequences. (Running on oeis4.)