|
%I #5 Oct 27 2018 16:17:48
%S 10,58,340,2014,11888,69274,401648,2329526,13514794,78445016,
%T 455726404,2650463368,15433424116,89977250572,525210971550,
%U 3069436719818,17959557595206,105203403819650,616942677047888,3621795968081798,21283870741193560,125201162038738596
%N Number of permutations p of [n] such that in 0p the largest up-jump equals five and no down-jump is larger than 2.
%H Alois P. Heinz, <a href="/A321112/b321112.txt">Table of n, a(n) for n = 5..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))(5):
%p seq(a(n), n=5..30);
%Y Column k=5 of A291680.
%K nonn
%O 5,1
%A _Alois P. Heinz_, Oct 27 2018
|
