|
%I #14 Mar 23 2021 16:12:57
%S 6,11,29,99,367,1543,7901,41759,241361,1647843,11321131,83279563,
%T 710717285,6009605795,53680350389,549737059971,5519982252151,
%U 58008028652479,693065960525741,8057982367331159,97381078055591177,1329697914765988419,17567989325451095443
%N Number of permutations of [n] with exactly n-3 (possibly overlapping) occurrences of some of the consecutive step patterns UUD, UDU, DUU (U=up, D=down).
%H Alois P. Heinz, <a href="/A231410/b231410.txt">Table of n, a(n) for n = 3..200</a>
%e a(3) = 6: 123, 132, 213, 231, 312, 321.
%e a(4) = 11: 1243, 1342, 2341 (UUD), 1324, 1423, 2314, 2413, 3412 (UDU), 2134, 3124, 4123 (DUU).
%e a(5) = 29: 12435, 12534, 13245, ..., 51243, 51342, 52341.
%e a(6) = 99: 124356, 125346, 126345, ..., 623514, 624513, 634512.
%e a(7) = 367: 1243576, 1243675, 1253476, ..., 7346125, 7356124, 7456123.
%p b:= proc(u, o, t, c) option remember; `if`(u+o<c, 0,
%p `if`(u+o=0, `if`(c=0, 1, 0),
%p add(b(u+j-1, o-j, [2, 3, 3, 6, 6, 3][t],
%p `if`(t in [5, 6], c-1, c)), j=1..o)+
%p add(b(u-j, o+j-1, [4, 5, 5, 4, 4, 5][t],
%p `if`(t=3, c-1, c)), j=1..u)))
%p end:
%p a:= n-> add(b(j-1, n-j, 1, n-3), j=1..n):
%p seq(a(n), n=3..25);
%t b[u_, o_, t_, c_] := b[u, o, t, c] = If[u + o < c, 0,
%t If[u + o == 0, If[c == 0, 1, 0],
%t Sum[b[u + j - 1, o - j, {2, 3, 3, 6, 6, 3}[[t]],
%t If[5 <= t <= 6, c - 1, c]], {j, 1, o}] +
%t Sum[b[u - j, o + j - 1, {4, 5, 5, 4, 4, 5}[[t]],
%t If[t == 3, c - 1, c]], {j, 1, u}]]];
%t a[n_] := Sum[b[j - 1, n - j, 1, n - 3], {j, 1, n}];
%t a /@ Range[3, 25] (* _Jean-François Alcover_, Mar 23 2021, after _Alois P. Heinz_ *)
%Y Diagonal of A231384.
%K nonn
%O 3,1
%A _Alois P. Heinz_, Nov 08 2013
|
