|
|
A250265
|
|
Number of permutations p of [n] such that p(i) > p(i+1) iff i == 1 (mod 9).
|
|
2
|
|
|
1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 89, 583, 2562, 8996, 27013, 72057, 175016, 393805, 831384, 14964895, 171416216, 1274511567, 7351608748, 35319494255, 147208687584, 546836589610, 1845658907261, 5742168041637, 149870423643695, 2452427105334001, 25693720399771170
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
LINKS
|
|
|
MAPLE
|
b:= proc(u, o, t) option remember; `if`(u+o=0, 1,
`if`(t=1, add(b(u-j, o+j-1, irem(t+1, 9)), j=1..u),
add(b(u+j-1, o-j, irem(t+1, 9)), j=1..o)))
end:
a:= n-> b(0, n, 0):
seq(a(n), n=0..35);
|
|
MATHEMATICA
|
b[u_, o_, t_] := b[u, o, t] = If[u + o == 0, 1, If[t == 1, Sum[b[u - j, o + j - 1, Mod[t + 1, 9]], {j, 1, u}], Sum[b[u + j - 1, o - j, Mod[t + 1, 9]], {j, 1, o}]]];
a[n_] := b[0, n, 0];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|