cp's OEIS Frontend

A177521 Number of permutations of 1..n avoiding adjacent step pattern up, down, up, up.

%I A177521 #19 Apr 20 2022 09:31:57
%S A177521 1,1,2,6,24,111,612,3906,28701,236527,2167862,21824925,239861934,
%T A177521 2854894485,36602472117,502718236303,7365503262033,114653301213668,
%U A177521 1889769527067410,32877891905367530,602116339324675145,11578253045158664158,233244225298760907868
%N A177521 Number of permutations of 1..n avoiding adjacent step pattern up, down, up, up.
%H A177521 Alois P. Heinz, <a href="/A177521/b177521.txt">Table of n, a(n) for n = 0..456</a>
%F A177521 a(n) ~ c * d^n * n!, where d = 0.91568163084580807076940792182223499091165..., c = 1.44100339681864767911275854344010332196608... . - _Vaclav Kotesovec_, Aug 29 2014
%p A177521 b:= proc(u, o, t) option remember; `if`(u+o=0, 1, `if`(t<3,
%p A177521       add(b(u+j-1, o-j, `if`(t=2, 3, 1)), j=1..o), 0)+
%p A177521       add(b(u-j, o+j-1, `if`(irem(t, 2)=0, 0, 2)), j=1..u))
%p A177521     end:
%p A177521 a:= n-> b(n, 0, 0):
%p A177521 seq(a(n), n=0..30);  # _Alois P. Heinz_, Oct 07 2013
%t A177521 b[u_, o_, t_] := b[u, o, t] = If[u + o == 0, 1, If[t < 3,
%t A177521      Sum[b[u + j - 1, o - j, If[t == 2, 3, 1]], {j, 1, o}] , 0] +
%t A177521      Sum[b[u - j, o + j - 1, If[EvenQ[t], 0, 2]], {j, 1, u}]];
%t A177521 a[n_] := b[n, 0, 0];
%t A177521 Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Apr 20 2022, after _Alois P. Heinz_ *)
%Y A177521 Columns k=11,13 of A242784.
%K A177521 nonn
%O A177521 0,3
%A A177521 _R. H. Hardin_, May 10 2010
%E A177521 a(17)-a(22) from _Alois P. Heinz_, Oct 07 2013
%E A177521 a(0)=1 from _Alois P. Heinz_, Apr 20 2022