Number T(n,k) of permutations p of [n] such that in 0p the largest up-jump equals k and no down-jump is larger than 2; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A291680
Number T(n,k) of permutations p of [n] such that in 0p the largest up-jump equals k and no down-jump is larger than 2; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =3a(9) =2a(10) =0a(11) =1a(12) =9a(13) =8a(14) =4a(15) =0a(16) =1a(17) =25a(18) =36a(19) =20a(20) =10a(21) =0a(22) =1a(23) =71a(24) =156a(25) =108a(26) =58a(27) =26a(28) =0a(29) =1
External references
- oeis: A291680