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”).

A321111
Number of permutations p of [n] such that in 0p the largest up-jump equals four and no down-jump is larger than 2.
2
4, 20, 108, 586, 3098, 16230, 85150, 446972, 2349616, 12376800, 65353448, 345933358, 1835637246, 9764363438, 52064375292, 278256581910, 1490475179006, 8000983513636, 43039329754332, 231982689315468, 1252791611642654, 6777998215153164, 36735901427197962
OFFSET
4,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))(4):
seq(a(n), n=4..30);
CROSSREFS
Column k=4 of A291680.
Sequence in context: A365226 A263965 A265084 * A319321 A321574 A377583
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Oct 27 2018
STATUS
approved