|
%I #5 Oct 27 2018 16:19:29
%S 26,170,1078,6772,42366,263548,1626122,9993996,61372356,376754190,
%T 2312742484,14199997152,87223775288,536072840284,3296748123732,
%U 20287763348424,124932460269594,769857062164974,4747179317544360,29291823451184116,180856995405347960
%N Number of permutations p of [n] such that in 0p the largest up-jump equals six and no down-jump is larger than 2.
%H Alois P. Heinz, <a href="/A321113/b321113.txt">Table of n, a(n) for n = 6..1000</a>
%p b:= proc(u, o, k) option remember; `if`(u+o=0, 1,
%p add(b(u-j, o+j-1, k), j=1..min(2, u))+
%p add(b(u+j-1, o-j, k), j=1..min(k, o)))
%p end:
%p a:= n-> (k-> b(0, n, k)-b(0, n, k-1))(6):
%p seq(a(n), n=6..30);
%Y Column k=6 of A291680.
%K nonn
%O 6,1
%A _Alois P. Heinz_, Oct 27 2018
|
