login
Number of permutations of {1,...,n} avoiding adjacent step pattern up, down, down, up, down, up.
2

%I #14 Apr 19 2022 11:01:41

%S 1,1,2,6,24,120,720,4859,37424,323784,3107520,32749200,376929246,

%T 4698101279,63058148792,906829731450,13911580276800,226738605155619,

%U 3912973221007668,71280397766349665,1366816300552776920,27519285653572655340,580456044040809459821

%N Number of permutations of {1,...,n} avoiding adjacent step pattern up, down, down, up, down, up.

%H Alois P. Heinz, <a href="/A177539/b177539.txt">Table of n, a(n) for n = 0..175</a>

%F a(n) ~ c * d^n * n!, where d = 0.958757960478580745672487123002941621817..., c = 1.30438280919882137519668832091857761... . - _Vaclav Kotesovec_, Jan 17 2015

%p b:= proc(u, o, t) option remember; `if`(t>6, 0, `if`(u+o+t<7, (u+o)!,

%p add(b(u-j, o+j-1, [1, 3, 4, 1, 6, 4][t]), j=1..u)+

%p add(b(u+j-1, o-j, [2, 2, 2, 5, 2, 7][t]), j=1..o)))

%p end:

%p a:= n-> b(n, 0, 1):

%p seq(a(n), n=0..25); # _Alois P. Heinz_, Oct 24 2013

%t b[u_, o_, t_] := b[u, o, t] = If[t > 6, 0, If[u + o + t < 7, (u + o)!,

%t Sum[b[u - j, o + j - 1, {1, 3, 4, 1, 6, 4}[[t]]], {j, 1, u}] +

%t Sum[b[u + j - 1, o - j, {2, 2, 2, 5, 2, 7}[[t]]], {j, 1, o}]]];

%t a[n_] := b[n, 0, 1];

%t Table[a[n], {n, 0, 25}] (* _Jean-François Alcover_, Apr 19 2022, after _Alois P. Heinz_ *)

%Y Columns k=37,41 of A242784.

%K nonn

%O 0,3

%A _R. H. Hardin_, May 10 2010

%E a(17)-a(22) from _Alois P. Heinz_, Oct 24 2013