The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191827 Number of n-step three-sided prudent self-avoiding walks ending at the southwest corner of their box. 6

%I #26 Aug 13 2020 22:14:23

%S 1,2,4,9,20,46,105,244,568,1332,3130,7385,17459,41382,98245,233663,

%T 556471,1327008,3167876,7570263,18106445,43342551,103826992,248886102,

%U 596973191,1432699552,3440164442,8264411848,19862617439,47757332813

%N Number of n-step three-sided prudent self-avoiding walks ending at the southwest corner of their box.

%H Alois P. Heinz, <a href="/A191827/b191827.txt">Table of n, a(n) for n = 0..100</a>

%H Mireille Bousquet-Mélou, <a href="https://dmtcs.episciences.org/3627">Families of prudent self-avoiding walks</a>, DMTCS proc. AJ, 2008, 167-180.

%H Mireille Bousquet-Mélou, <a href="https://arxiv.org/abs/0804.4843">Families of prudent self-avoiding walks</a>, arXiv:0804.4843 [math.CO], 2008-2009.

%H Enrica Duchi, <a href="https://hal.archives-ouvertes.fr/hal-00159320">On some classes of prudent walks</a>, in: FPSAC'05, Taormina, Italy, 2005.

%e a(4) = 20: NWWS, NWSW, NWSS, WNWS, WWWW, WWWS, WWSW, WWSS, WSWW, WSWS, WSSW, WSSS, SWWW, SWWS, SWSW, SWSS, SSWW, SSWS, SSSW, SSSS.

%p b:= proc(d, i, n, x, y, w, s) option remember;

%p `if`(s+w>n, 0, `if`(n=0, `if`(s=0 and w=0, 1, 0),

%p `if`(d in [0, 1] or d in [2, 4] and x=0 or d=2 and i,

%p b(1, evalb(x=0), n-1, max(x-1, 0), y, w+1, s), 0) +

%p `if`(d in [0, 2] or d in [1, 3] and (y=0 or i),

%p b(2, evalb(y=0), n-1, x, max(y-1, 0), w, s+1), 0) +

%p `if`(d in [0, 3] or d in [2, 4] and w=0 or d=2 and i,

%p b(3, evalb(w=0), n-1, x+1, y, max(w-1, 0), s), 0) +

%p `if`(d in [0, 4] or d in [1, 3] and (s=0 or i),

%p b(4, evalb(s=0), n-1, x, y+1, w, max(s-1, 0)), 0)))

%p end:

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

%p seq(a(n), n=0..30);

%t b[d_, i_, n_, x_, y_, w_, s_] := b[d, i, n, x, y, w, s] = If[s+w > n, 0, If[n == 0, If[s == 0 && w == 0, 1, 0], If[MatchQ[d, 0|1] || d != 3 && x == 0 || d == 2 && i, b[1, x == 0, n-1, Max[x-1, 0], y, w+1, s], 0] + If[MatchQ[d, 0|2] || d != 4 && (y == 0 || i), b[2, y == 0, n-1, x, Max[y-1, 0], w, s+1], 0]+If[MatchQ[d, 0|3] || d != 1 && w == 0 || d == 2 && i, b[3, w == 0, n-1, x+1, y, Max[w-1, 0], s], 0] + If[MatchQ[d, 0|4] || d != 2 && i, b[4, s == 0, n-1, x, y+1, w, Max[s-1, 0]], 0]]]; a[n_] := b[0, True, n, 0, 0, 0, 0]; Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Dec 22 2014, after _Alois P. Heinz_ *)

%Y Cf. A191823, A191824, A191825, A191826, A191828.

%K nonn,walk

%O 0,2

%A _Alois P. Heinz_, Jun 17 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 11 00:20 EDT 2024. Contains 373283 sequences. (Running on oeis4.)