|
|
A302691
|
|
Number of broken alternating permutations of n things.
|
|
2
|
|
|
0, 0, 1, 2, 7, 26, 117, 594, 3407, 21682, 151853, 1160026, 9600567, 85566378, 817099909, 8322907298, 90074979487, 1032183177314, 12485056392285, 158964674218410, 2125201153260167, 29764791617545690, 435823661971532981, 6658895050949717362, 105979606291488794607
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
A permutation of {1,2,...,n} is said to be a "broken alternating permutation" if it is an alternating permutation (cf. A000111) except at one point. See El Hilany and Rau for precise definition and an explicit formula.
|
|
LINKS
|
|
|
FORMULA
|
a(n) ~ (4 - Pi) * 2^(n + 5/2) * n^(n + 3/2) / (exp(n) * Pi^(n + 3/2)). - Vaclav Kotesovec, Apr 14 2018
|
|
MAPLE
|
b:= proc(u, o, t) option remember;
`if`(u+o=0, t, add(b(o+j-1, u-j, t), j=1..u)+
`if`(t=0, add(b(o-j, u-1+j, 1), j=1..o), 0))
end:
a:= n-> b(n, 0$2):
# second Maple program:
egf:= (cos(x)-sin(x)+x-1)/(sin(x)-1):
a:= n-> n! * coeff(series(egf, x, n+1), x, n):
|
|
MATHEMATICA
|
b[u_, o_, t_] := b[u, o, t] = If[u + o == 0, t, Sum[b[o + j - 1, u - j, t], {j, 1, u}] + If[t == 0, Sum[b[o - j, u - 1 + j, 1], {j, 1, o}], 0]];
a[n_] := b[n, 0, 0];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|