|
%I #5 Oct 27 2018 16:26:53
%S 2126,18094,138568,1004762,7065186,48767474,332656900,2251145590,
%T 15147986104,101498413174,677767802220,4514436576522,30014218133762,
%U 199270720886422,1321592750970506,8757889640855800,58000722621872304,383941464541725814,2540655228539643752
%N Number of permutations p of [n] such that in 0p the largest up-jump equals ten and no down-jump is larger than 2.
%H Alois P. Heinz, <a href="/A321117/b321117.txt">Table of n, a(n) for n = 10..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))(10):
%p seq(a(n), n=10..30);
%Y Column k=10 of A291680.
%K nonn
%O 10,1
%A _Alois P. Heinz_, Oct 27 2018
|
