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

%I #17 Apr 19 2022 11:33:19

%S 1,1,2,6,24,120,720,5011,39856,356616,3545280,38768400,462487631,

%T 5977005477,83186290826,1240460869290,19730730733920,333451122953921,

%U 5966845400766578,112703780178989573,2240828272067529040,46780834679854338540,1023129822229674425971

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

%H Alois P. Heinz, <a href="/A177535/b177535.txt">Table of n, a(n) for n = 0..200</a>

%F a(n) ~ c * d^n * n!, where d = 0.9941229421721758523485136789468386588070503717223814960732680334748287519..., c = 1.036291721564809563490641628457988175489113294377683691938047314400726... . - _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, 5, 6, 1][t]), j=1..u)+

%p add(b(u+j-1, o-j, [2, 2, 2, 2, 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 22 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, 5, 6, 1}[[t]]], {j, 1, u}] +

%t Sum[b[u + j - 1, o - j, {2, 2, 2, 2, 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 Column k=33 of A242784.

%K nonn

%O 0,3

%A _R. H. Hardin_, May 10 2010

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