|
|
A262165
|
|
Number of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value <= 3.
|
|
4
|
|
|
1, 1, 2, 5, 19, 82, 454, 2795, 20346, 162613, 1469309, 14424200, 155842828, 1812646171, 22807141756, 306480808871, 4403059520043, 67100946088054, 1084001371054298, 18469410744415367, 331442882307143590, 6242679740272435021, 123215973021475320637
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
b:= proc(u, o, c) option remember; `if`(c<0 or c>3, 0, `if`(u+o=0,
x^c, (p-> add(coeff(p, x, i)*x^max(i, c), i=0..3))(add(
b(u-j, o-1+j, c-1), j=1..u)+add(b(u+j-1, o-j, c+1), j=1..o))))
end:
a:= n-> (p-> add(coeff(p, x, i), i=0..min(n, 3)))(b(0, n, 0)):
seq(a(n), n=0..25);
|
|
MATHEMATICA
|
b[u_, o_, c_] := b[u, o, c] = If[c < 0 || c > 3, 0, If[u + o == 0, x^c, Function[p, Sum[Coefficient[p, x, i]*x^Max[i, c], {i, 0, 3}]][Sum[b[u - j, o - 1 + j, c - 1], {j, u}] + Sum[b[u + j - 1, o - j, c + 1], {j, o}]]]];
a[n_] := Function[p, Sum[Coefficient[p, x, i], {i, 0, Min[n, 3]}]][b[0, n, 0]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|