|
|
A321117
|
|
Number of permutations p of [n] such that in 0p the largest up-jump equals ten and no down-jump is larger than 2.
|
|
2
|
|
|
2126, 18094, 138568, 1004762, 7065186, 48767474, 332656900, 2251145590, 15147986104, 101498413174, 677767802220, 4514436576522, 30014218133762, 199270720886422, 1321592750970506, 8757889640855800, 58000722621872304, 383941464541725814, 2540655228539643752
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
10,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))(10):
seq(a(n), n=10..30);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|