login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A321112
Number of permutations p of [n] such that in 0p the largest up-jump equals five and no down-jump is larger than 2.
2
10, 58, 340, 2014, 11888, 69274, 401648, 2329526, 13514794, 78445016, 455726404, 2650463368, 15433424116, 89977250572, 525210971550, 3069436719818, 17959557595206, 105203403819650, 616942677047888, 3621795968081798, 21283870741193560, 125201162038738596
OFFSET
5,1
LINKS
MAPLE
b:= proc(u, o, k) option remember; `if`(u+o=0, 1,
add(b(u-j, o+j-1, k), j=1..min(2, u))+
add(b(u+j-1, o-j, k), j=1..min(k, o)))
end:
a:= n-> (k-> b(0, n, k)-b(0, n, k-1))(5):
seq(a(n), n=5..30);
CROSSREFS
Column k=5 of A291680.
Sequence in context: A055583 A242202 A125320 * A126730 A126478 A223470
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Oct 27 2018
STATUS
approved