|
| |
|
|
A330079
|
|
Number of n-step self-avoiding walks starting at the origin that are restricted to the boundary walls of the first octant of the cubic lattice.
|
|
1
|
|
|
|
1, 3, 9, 27, 75, 213, 585, 1623, 4425, 12123, 32883, 89415, 241557, 653649, 1760427, 4747005, 12754593, 34301463
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
These are walks in the first octant of the cubic lattice, never leaving the three walls forming the octant. The walls are the sets of points (x>=0, y>=0, z=0), (x>=0, y=0, z>=0), and (x=0, y>=0, z>=0) with (x,y,z) in Z^3.
|
|
|
LINKS
|
Table of n, a(n) for n=0..17.
Francois Alcover, 14-step walk
Francois Alcover, nodejs script
|
|
|
CROSSREFS
|
Cf. A001411, A001412.
The "snake in the box" problem (A000937, A099155) has a similar flavor. - N. J. A. Sloane, Dec 01 2019
Sequence in context: A180238 A289693 A269684 * A135415 A182897 A228734
Adjacent sequences: A330076 A330077 A330078 * A330080 A330081 A330082
|
|
|
KEYWORD
|
nonn,more,walk
|
|
|
AUTHOR
|
Francois Alcover, Nov 30 2019
|
|
|
STATUS
|
approved
|
| |
|
|
