This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A330079 #33 Oct 28 2023 09:23:50 %S A330079 1,3,9,27,75,213,585,1623,4425,12123,32883,89415,241557,653649, %T A330079 1760427,4747005,12754593,34301463,91990575,246880023,661075149, %U A330079 1771199169,4736741853,12673587057,33856816431,90482953989,241499070195,644781165933,1719559634451,4587222964881,12225165127887 %N 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. %C A330079 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. %H A330079 Francois Alcover, <a href="/A330079/a330079.png">14-step walk</a> %H A330079 Francois Alcover, <a href="/A330079/a330079.js.txt">nodejs script</a> %Y A330079 Cf. A001411, A001412. %Y A330079 The "snake in the box" problem (A000937, A099155) has a similar flavor. - _N. J. A. Sloane_, Dec 01 2019 %K A330079 nonn,walk %O A330079 0,2 %A A330079 _Francois Alcover_, Nov 30 2019 %E A330079 a(18)-a(25) _Scott R. Shannon_, Aug 17 2020 %E A330079 a(26)-a(30) from _Bert Dobbelaere_, Oct 28 2023