OFFSET
1,1
COMMENTS
Using coordinates (x,y,z,t) such that x+y+z+t = 0 or 1, then the four neighbors of (x,y,z,t) are found by changing one coordinate by +- 1 (such that the sum of coordinates remains 0 or 1). This sequence gives the number of self-avoiding walks of length n starting from (0,0,0,0) such that t <= z for all points and t = z for the final point. - Sean A. Irvine, Nov 11 2017
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. Ishinabe and S. G. Whittington, Surface critical exponents for self-avoiding walks on the tetrahedral lattice, J. Phys. A 14 (1981), 439-446.
CROSSREFS
KEYWORD
nonn,walk
AUTHOR
EXTENSIONS
a(21)-a(27) from Sean A. Irvine, Nov 11 2017
STATUS
approved