|
%I #11 Jun 28 2021 08:53:51
%S 1,3,6,16,38,93,93,223,540,1305,3157,7629,18436,44543,107607,259899,
%T 627606,1515284,3657904,8828836
%N Number of two-sided n-step prudent walks ending on the top side of their boxes, avoiding exactly two consecutive west steps and south steps.
%H S. Gao and H. Niederhausen, <a href="http://math.fau.edu/Niederhausen/HTML/Papers/Sequences%20Arising%20From%20Prudent%20Self-Avoiding%20Walks-February%2001-2010.pdf">Sequences Arising From Prudent Self-Avoiding Walks</a>, 2010.
%K nonn,walk,more
%O 1,2
%A _Shanzhen Gao_, May 18 2011
|
