a(n) is the number of the two-sided n-step prudent walks ending on the top side of their box, avoiding both patterns Left^k and Down^k for k>=3.
A178035
a(n) is the number of the two-sided n-step prudent walks ending on the top side of their box, avoiding both patterns Left^k and Down^k for k>=3.
Terms
- a(0) =1a(1) =3a(2) =7a(3) =18a(4) =44a(5) =110a(6) =273a(7) =679a(8) =1687a(9) =4191a(10) =10406a(11) =25830a(12) =64097a(13) =159015a(14) =394391a(15) =977939a(16) =2424370a(17) =5977180a(18) =14756906
External references
- oeis: A178035