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!)
A303697 Number T(n,k) of permutations p of [n] whose difference between sum of up-jumps and sum of down-jumps equals k; triangle T(n,k), n>=0, min(0,1-n)<=k<=max(0,n-1), read by rows. 6

%I #29 Feb 20 2021 03:40:32

%S 1,1,1,0,1,1,1,2,1,1,1,4,5,4,5,4,1,1,11,19,19,20,19,19,11,1,1,26,82,

%T 100,101,100,101,100,82,26,1,1,57,334,580,619,619,620,619,619,580,334,

%U 57,1,1,120,1255,3394,4339,4420,4421,4420,4421,4420,4339,3394,1255,120,1

%N Number T(n,k) of permutations p of [n] whose difference between sum of up-jumps and sum of down-jumps equals k; triangle T(n,k), n>=0, min(0,1-n)<=k<=max(0,n-1), read by rows.

%C An up-jump j occurs at position i in p if p_{i} > p_{i-1} and j is the index of p_i in the increasingly sorted list of those elements in {p_{i}, ..., p_{n}} that are larger than p_{i-1}. A down-jump j occurs at position i in p if p_{i} < p_{i-1} and j is the index of p_i in the decreasingly sorted list of those elements in {p_{i}, ..., p_{n}} that are smaller than p_{i-1}. First index in the lists is 1 here.

%H Alois P. Heinz, <a href="/A303697/b303697.txt">Rows n = 0..125, flattened</a>

%F T(n,0) = A153229(n) for n > 0.

%F T(n,1) = A005165(n-1) for n > 0.

%F T(n+1,n-1) = A000295(n).

%F T(n,k) = T(n,-k).

%F Sum_{k=0..n-1} k^2 * T(n,k) = A001720(n+2) for n>1.

%e Triangle T(n,k) begins:

%e : 1 ;

%e : 1 ;

%e : 1, 0, 1 ;

%e : 1, 1, 2, 1, 1 ;

%e : 1, 4, 5, 4, 5, 4, 1 ;

%e : 1, 11, 19, 19, 20, 19, 19, 11, 1 ;

%e : 1, 26, 82, 100, 101, 100, 101, 100, 82, 26, 1 ;

%e : 1, 57, 334, 580, 619, 619, 620, 619, 619, 580, 334, 57, 1 ;

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

%p add(b(u-j, o+j-1)*x^(-j), j=1..u)+

%p add(b(u+j-1, o-j)*x^( j), j=1..o)))

%p end:

%p T:= n-> (p-> seq(coeff(p, x, i), i=ldegree(p)..degree(p)))(

%p `if`(n=0, 1, add(b(j-1, n-j), j=1..n))):

%p seq(T(n), n=0..12);

%t b[u_, o_] := b[u, o] = Expand[If[u+o == 0, 1,

%t Sum[b[u-j, o+j-1] x^-j, {j, 1, u}] +

%t Sum[b[u+j-1, o-j] x^j, {j, 1, o}]]];

%t T[0] = {1};

%t T[n_] := x^n Sum[b[j-1, n-j], {j, 1, n}] // CoefficientList[#, x]& // Rest;

%t T /@ Range[0, 12] // Flatten (* _Jean-François Alcover_, Feb 20 2021, after _Alois P. Heinz_ *) *)

%Y Row sums give A000142.

%Y Cf. A000295, A001720, A005165, A008292, A081285, A153229, A291680, A291684, A291722, A316292, A316293, A321316.

%K nonn,tabf

%O 0,8

%A _Alois P. Heinz_, Apr 28 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 April 18 06:12 EDT 2024. Contains 371769 sequences. (Running on oeis4.)