cp's OEIS Frontend

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.

Showing 1-10 of 11 results. Next

A337023 Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h X 2h X 2h where the walk starts at the center of the box.

Original entry on oeis.org

6, 24, 6, 72, 30, 6, 168, 144, 30, 6, 456, 624, 150, 30, 6, 1032, 2520, 720, 150, 30, 6, 2712, 9360, 3408, 726, 150, 30, 6, 5784, 34008, 15432, 3528, 726, 150, 30, 6, 14640, 120960, 68088, 16776, 3534, 726, 150, 30, 6, 29760, 430656, 289128, 79320, 16920, 3534, 726, 150, 30, 6
Offset: 1

Views

Author

Scott R. Shannon, Aug 11 2020

Keywords

Examples

			T(1,2) = 24 as after a step in one of the six axial directions the walk must turn along the face of the box; this eliminates the 2-step straight walk in all directions, so the total number of walks is 6*5-6 = 24.
.
The table begins:
.
6 24  72 168  456  1032  2712   5784   14640   29760    71136    133344    291696..
6 30 144 624 2520  9360 34008 120960  430656 1511856  5340312  18587208  65176416..
6 30 150 720 3408 15432 68088 289128 1205976 4920528 19985928  80066136 321160728..
6 30 150 726 3528 16776 79320 366960 1677864 7516992 33312456 145379760 630249720..
6 30 150 726 3534 16920 81216 385224 1822584 8518920 39588480 181800312 829567656..
6 30 150 726 3534 16926 81384 387768 1850376 8765304 41478144 194837136 912538512..
6 30 150 726 3534 16926 81390 387960 1853664 8805504 41872944 198158520 937459176..
6 30 150 726 3534 16926 81390 387966 1853880 8809632 41928816 198761160 942984312..
6 30 150 726 3534 16926 81390 387966 1853886 8809872 41933880 198836352 943868424..
6 30 150 726 3534 16926 81390 387966 1853886 8809878 41934144 198842448 943966968..
6 30 150 726 3534 16926 81390 387966 1853886 8809878 41934150 198842736 943974192..
6 30 150 726 3534 16926 81390 387966 1853886 8809878 41934150 198842742 943974504..
6 30 150 726 3534 16926 81390 387966 1853886 8809878 41934150 198842742 943974510..
		

Crossrefs

Cf. A001412 (h->infinity), A337021 (h=1), A337031 (start at center of face), A337035 (start as corner of box), A336862 (start at middle of edge), A116904, A039648.

Formula

For n <= h, T(h,n) = A001412(n).
Row 1 = T(1,n) = A337021(n).
For n >= (2h+1)^3, T(h,n) = 0 as the walk contains more steps than there are available lattice points in the 2h X 2h X 2h box.

A337761 The number of hanging vertically stable self-avoiding walks of length n on a 3D cubic lattice where both the nodes and connecting rods have mass.

Original entry on oeis.org

1, 1, 1, 1, 1, 5, 13, 29, 73, 193, 581, 1717, 7029, 21981, 79625, 248697, 981353, 3275085, 13235333
Offset: 1

Views

Author

Scott R. Shannon, Sep 19 2020

Keywords

Comments

Consider a self-avoiding walk on a 3D cubic lattice where each visited node is given a fixed mass and each node is connected by a rod of another fixed mass. Hang the resulting lattice structure from a string at the first node. This sequence gives the number of walks of length n such that the structure will hang perfectly vertically, and will return to this position if perturbed.
For a walk to be stable requires the torque around the first node to be zero along both the x and y axial directions for both the node and rod masses, and that the overall center of mass of the structure is lower than the first node. As n increases the number of walks satisfying these conditions decreases rapidly. For example the total number of 3D self-avoiding walks on a cubic lattice in the lower four quadrants for n=18 is A116904(18) = 719101961769. The total number of hanging stable walks for n=18 is 3275085, indicating only one in about 220 thousand walks is stable.
The stable walks are the same as in the 2D case, see A335780, up until n=9; the same stable single-plane walks occur but in both the x-z and y-z plane so the total of these walks is twice A335780. From n=10 stable walks can occur which use all three dimensions. For all stable walks it is found that the final node is always directly underneath the starting node. This is not the case if only the node or rod masses are considered.
See A335780 for the equalivalent sequence on a 2D square lattice.

Examples

			a(1)-a(5) = 1 as the only stable walk is a walk straight down from the first node.
a(6) = 5. There is one stable walk confined to a single plane:
.
      X-----+
            |
            |
+-----+-----+
|
|
+-----+
.
where 'X' represents the hanging point first node at (0,0,0).
Assuming a mass of p for the nodes, q for the rods, and a length l for the rods, the total torque from the nodes to the right of the first node is 2*p*l, which equals that from the nodes to the left. The total torque for the rods to the right of the first node is 2*q*(1/2)*l + 1*q*1*l = 2ql, which equals that from the rods to the left. The center of mass is at coordinate (0,0,-1). This walk can be taken in 4 ways thus, with the straight down walk, the total number of stable walks is 4+1 = 5.
a(10) = 193. Other than the straight and single plane walks those using three dimensions now occur. An example of such a walk is:
.
        +--------+      z    y
       /        /        \  /
      /   X-------+       \/
     /        /    \       +-----x
    /        /      \
   +        +        +
    \      /        /
     \    /        /
      +--/----+   /
        /        /
       +--------+
.
The total rotational torque around the y-axis from the nodes with x>0 is 3*p*l, which equals that from the nodes with x<0. The total rotational torque around the x-axis from the nodes with y>0 is 2*p*l, which equals that from the nodes with y<0. The total rotational torque around the y-axis from the rods with x>0 is 2*q*(1/2)*l + 2*q*1*l = 3ql, which equals that from the rods with x<0.  The total rotational torque around the x-axis from the rods with y>0 is 2*q*(1/2)*l + 1*q*1*l = 2ql, which equals that from the rods with x<0. The center of mass is at coordinate (0,0,-1).
a(11) = 581. An example of an 11 step stable walk where the final node is above the first node:
.
                   +              +
                  /              /|       z
                 /              / |       |  y
                /              /  |       | /
               +              /   |       |/
        +      |   X---------+    |       +-----x
       /|      |       +----------+
      / |      |      /
     /  |      |     /
    /   |      |    /
   +-----------+   /
        +---------+
.
This particular walk would be counted twice as it is also stable if hung from the final node.
See the linked text file for the step directions for the stable walks for n=6 to n=12.
		

Crossrefs

A337400 Table read by antidiagonals: T(w,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a tube of cross section 2w X 2w where the walk starts at the middle of the tube.

Original entry on oeis.org

6, 26, 6, 98, 30, 6, 330, 146, 30, 6, 1130, 658, 150, 30, 6, 3746, 2858, 722, 150, 30, 6, 12802, 11802, 3450, 726, 150, 30, 6, 42498, 48282, 15930, 3530, 726, 150, 30, 6, 143610, 193714, 72522, 16826, 3534, 726, 150, 30, 6, 472242, 781114, 321794, 80010, 16922, 3534, 726, 150, 30, 6
Offset: 1

Views

Author

Scott R. Shannon, Aug 26 2020

Keywords

Examples

			T(1,2) = 26 as after a step in one of the four directions toward the tube's side the walk must turn along the side; this eliminates the 2-step straight walk in those four directions, so the total number of walks is 6*5 - 4 = 26.
The table begins:
6 26  98 330 1130  3746 12802  42498  143610  472242  1570714   5110426  16779354...
6 30 146 658 2858 11802 48282 193714  781114 3114890 12508114  49767002 199252346...
6 30 150 722 3450 15930 72522 321794 1415450 6134650 26527690 113725546 487875250...
6 30 150 726 3530 16826 80010 373962 1736538 7946946 36158802 162796866 730521658...
6 30 150 726 3534 16922 81274 386138 1833018 8615906 40370370 187477426 867587114...
6 30 150 726 3534 16926 81386 387834 1851546 8780162 41630146 196172338 923017178...
6 30 150 726 3534 16926 81390 387962 1853738 8806962 41893346 198386594 939630954...
6 30 150 726 3534 16926 81390 387966 1853882 8809714 41930594 198788354 943314378...
6 30 150 726 3534 16926 81390 387966 1853886 8809874 41933970 198838482 943903786...
6 30 150 726 3534 16926 81390 387966 1853886 8809878 41934146 198842546 943969482...
6 30 150 726 3534 16926 81390 387966 1853886 8809878 41934150 198842738 943974298...
6 30 150 726 3534 16926 81390 387966 1853886 8809878 41934150 198842742 943974506...
6 30 150 726 3534 16926 81390 387966 1853886 8809878 41934150 198842742 943974510...
		

Crossrefs

Cf. A337401 (start at center of tube's side), A337403 (start at tube's edge), A001412 (w->infinity), A116904, A337023, A259808, A039648.

Formula

For n <= w, T(w,n) = A001412(n).

A337031 Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h x 2h x 2h where the walk starts at the center of one of the box's faces.

Original entry on oeis.org

5, 17, 5, 52, 21, 5, 148, 89, 21, 5, 400, 357, 93, 21, 5, 1060, 1424, 405, 93, 21, 5, 2700, 5484, 1789, 409, 93, 21, 5, 6720, 20960, 7705, 1849, 409, 93, 21, 5, 15760, 78412, 33048, 8257, 1853, 409, 93, 21, 5, 36248, 292168, 139032, 37097, 8329, 1853, 409, 93, 21, 5
Offset: 1

Views

Author

Scott R. Shannon, Aug 12 2020

Keywords

Examples

			T(1,2) = 17. Taking the first step right,left,forward or backward hits the box's edge after which the walks has three directions for the second step, giving 4*3 = 12 walks in all. A first step upward can be followed by a second step in five directions. The total number of 2-step walks is therefore 12+5 = 17.
.
The table begins:
.
5 17 52 148  400 1060  2700   6720  15760   36248    77856   163296    312760...
5 21 89 357 1424 5484 20960  78412 292168 1072272  3919000 14145220  50832492...
5 21 93 405 1789 7705 33048 139032 583256 2422480 10053452 41415564 170419680...
5 21 93 409 1849 8257 37097 164533 728808 3194636 13978148 60739156 263711448...
5 21 93 409 1853 8329 37877 171117 776065 3496769 15758504 70593984 315942684...
5 21 93 409 1853 8333 37961 172165 786089 3577129 16326745 74257917 337994448...
5 21 93 409 1853 8333 37965 172261 787445 3591637 16455441 75254865 344977177...
5 21 93 409 1853 8333 37965 172265 787553 3593341 16475617 75451269 346633713...
5 21 93 409 1853 8333 37965 172265 787557 3593461 16477709 75478437 346921841...
5 21 93 409 1853 8333 37965 172265 787557 3593465 16477841 75480957 346957465...
5 21 93 409 1853 8333 37965 172265 787557 3593465 16477845 75481101 346960453...
5 21 93 409 1853 8333 37965 172265 787557 3593465 16477845 75481105 346960609...
5 21 93 409 1853 8333 37965 172265 787557 3593465 16477845 75481105 346960613...
		

Crossrefs

Cf. A116904 (h->infinity), A337033 (h=1), A337023 (start at center of box), A336862 (start at middle of edge), A337035 (start at corner of box), A001412.

Formula

For n <= h, T(h,n) = A116904(n).
Row 1 = T(1,n) = A337033(n).
For n >= (2h+1)^3, T(h,n) = 0 as the walk contains more steps than there are available lattice points in the 2h X 2h X 2h box.

A337033 The number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2x2x2 where the walk starts at the center of one of the box's faces.

Original entry on oeis.org

1, 5, 17, 52, 148, 400, 1060, 2700, 6720, 15760, 36248, 77856, 163296, 312760, 590536, 995160, 1663664, 2405056, 3482320, 4180656, 5080320, 4823560, 4686432, 3165088, 2228584, 792272, 303264, 0
Offset: 0

Views

Author

Scott R. Shannon, Aug 12 2020

Keywords

Examples

			a(1) = 5 as the walk is free to move one step in five possible directions. It cannot take a step to a direction opposite to the face's normal it starts on.
a(2) = 17. Taking the first along the starting face hits the box's edge after which the walks has three directions for the second step, giving 4*3 = 12 walks in all. A first step away from the starting face can be followed by a second step in five directions. The total number of 2-step walks is therefore 12+5 = 17.
a(26) = 303264. This is the total number of ways a 26-step walk can completely fill the 2x2x2 box's 26 available lattice points. Unlike the walk which starts at the center of the box, see A337021, all lattice points can be visited in one walk.
		

Crossrefs

Cf. A337031 (other box sizes), A337021 (start at center of box), A335806 (start at middle of edge), A337034 (start at corner of box), A001412, A116904.

Formula

For n>=27 all terms are 0 as the walk contains more steps than there are available lattice points in the 2x2x2 box.

A337401 Triangle read by rows: T(n,w) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a tube of cross section 2w X 2w where the walk starts at the center of the tube's side.

Original entry on oeis.org

5, 19, 21, 72, 91, 93, 258, 383, 407, 409, 926, 1638, 1821, 1851, 1853, 3176, 6856, 8019, 8295, 8331, 8333, 11000, 28810, 35506, 37531, 37921, 37963, 37965, 36988, 119106, 155492, 168399, 171691, 172215, 172263, 172265, 125302, 492766, 683126, 758182, 781811, 786823, 787501, 787555, 787557
Offset: 1

Views

Author

Scott R. Shannon, Aug 26 2020

Keywords

Examples

			T(2,1) = 19 as after a step in one of the two directions toward the adjacent tube side the walk must turn along the side; this eliminates the 2-step straight walk in those two directions, so the total number of walks is 4*4 + 5 - 2 = 19.
The table begins:
5;
19,21;
72,91,93;
258,383,407,409;
926,1638,1821,1851,1853;
3176,6856,8019,8295,8331,8333;
11000,28810,35506,37531,37921,37963,37965;
36988,119106,155492,168399,171691,172215,172263,172265;
125302,492766,683126,758182,781811, 786823,787501,787555,787557;
414518,2013142,2981996,3393526,3545117,3585297,3592551,3593403,3593463,3593465;
		

Crossrefs

Cf. A337400 (start at middle of tube), A337403 (start at tube's edge), A116904 (w->infinity), A001412, A337023, A259808, A039648.

Formula

For w>=n, T(n,w) = A116904(n).

A337317 The number of stable vertically balanced self-avoiding walks of length n on the upper half-plane of a 2D square lattice where the nodes and connecting rods have equal mass.

Original entry on oeis.org

2, 4, 10, 24, 60, 138, 348, 832, 2104, 5192, 13178, 32662, 82890, 207888, 529738, 1339188, 3424526, 8698382, 22294906, 56836056, 145982928, 373363770, 960834764, 2463930512, 6351046936, 16322104184, 42131167144, 108478565772, 280360764620
Offset: 1

Views

Author

Scott R. Shannon, Sep 28 2020

Keywords

Comments

This is a variation of A337860 where only walks which are stable against a small perturbation from either left or right are counted. This means any walks which have their center-of-mass directly above the extrema of the nodes touching the y=0 starting line are not counted, e.g. a walk directly up from the first node.
See A337860 for further details and examples of the walks in this sequence.

Examples

			a(1) = 2. The two stable walks are a single step left or right from the first node. The walk consisting of a single vertical step is not counted, as it has its center-of-mass directly above the single node touching the y=0 line and will thus topple with a slight perturbation from either the left or right directions.
a(3) = 10. The stable 3-step walks with a first step up or to the right are:
.
                                            +
+---+                         +  +---+      |
|   |  X---+---+---+          |      |      +
X   +                 X---+---+  X---+      |
                                        X---+
.
These walks can also be taken with a first or second step to the left, giving a total number of stable walks of 2*5 = 10.
The semi-stable 3-step walks which are not counted in this sequence, but are counted in A337860, are:
.
                        +
                        |
    +---+   +---+       +
    |           |       |
X---+           +---X   +
                        |
                        X
.
as a slight perturbation from the left, right, and left or right would topple the first, second and third structure respectively.
		

Crossrefs

Cf. A337860 (count semi-stable walks), A335780, A337761, A116903, A116904, A001411.

A337860 The number of vertically balanced self-avoiding walks of length n on the upper half-plane of a 2D square lattice where the nodes and connecting rods have equal mass.

Original entry on oeis.org

3, 5, 13, 27, 65, 145, 361, 855, 2163, 5303, 13419, 33195, 84159, 210765, 536871, 1356153, 3466533, 8799247, 22541583, 57428441, 147423495, 376838119, 969292869, 2484478265, 6401330591, 16445203213, 42434086359, 109225591309, 282209330237
Offset: 1

Views

Author

Scott R. Shannon, Sep 27 2020

Keywords

Comments

Consider a self-avoiding walk in the upper half-plane on a 2D square lattice where each visited node is given a fixed mass and each node is connected by a rod of the same mass. Let the resulting lattice structure be free to move in a downward gravitational field. This sequence gives the number of walks of length n such that the structure will remain in place and will not topple given no sideways perturbations.
For a walk to be stable requires the center-of-mass of the resulting structure to be above or inside the extrema of the horizontal positions of the nodes that are on the y=0 line where the walk begins. Here we assume no perturbations so allow walks which would topple if either a left or right perturbation acts, for example we allow a directly vertical walk above the starting node. For the number of walks where such semi-stable structures are not counted see A337317.
We also assume the nodes and the rods are of equal mass. This is required as some structures exist which are either stable or would topple depending on the relative mass of the nodes and rods. For example the 8-step walk:
.
+---+---+
|
+
|
+---+
|
X---+---+
.
Considering only the nodes the center-of-mass is at position 17/9 (~1.88) relative to the starting x=0 'X' position - this is between the x=0 and x=2 extrema of the nodes at y=0 and is thus stable. Considering only the rods the center-of-mass is at position 33/16 (~2.06) relative to 'X' - this is to the right of the node at x=2 and thus the structure would topple to the right. To avoid such issues we assume both rods and nodes are of equal mass. Given that, the center-of-mass of this walk is at 67/34 (~1.97) and is thus stable.
The number of stable walks in this sequence does not decrease as rapidly as compared to the number of hanging 2D stable walks of A335780. For example the total number of 2D self-avoiding walks on a square lattice in the upper half plane for n=29 is A116903(27) = 1577923781445. The total number of vertically stable walks here for n=29 is 282209330237, indicating about 1 in 6 walks are stable. This is expected as many otherwise unstable walks becomes stable if some node touches the y=0 line away from the starting node; this becomes relatively common as n increases. Any of the symmetrical walks in A335780 which have no nodes above the starting node will also be in this sequence, inverted from top to bottom.

Examples

			a(3) = 13. The stable 3-step walks with a first step upward or to the right are:
.
                                                              +
                                                          +   |
                        +      +---+   +---+   +---+      |   +
                        |      |           |   |   |      +   |
X---+---+---+   X---+---+  X---+       X---+   X   +      |   +
                                                      X---+   |
                                                              X
.
The first six walks can also be taken with a first or second step to the left, giving a total number of stable walks of 2*6 + 1 = 13. Note that the third walk would topple with a perturbation to the right, and the final walk would topple with a perturbation to either the left or right.
The three non-stable 3-step walks in the first quadrant are:
.
    +               +---+
    |               |
+---+   +---+---+   +
|       |           |
X       X           X
.
These can also be taken with a second step to the left, giving six unstable walks.
a(23) = 969292869. An example of a stable 23-step walk with a base of 1 unit is:
.
                        +---+
                        |   |
    +---+---+---+---+---+   +
    |                       |
+---+               +---+   +
|                   |   |   |
+---+---+---+   +---+   +---+
            |   |
            +   X
.
		

Crossrefs

Cf. A337317 (do not count semi-stable walks), A335780, A337761, A116903, A116904, A001411.

A338126 Triangle read by rows: T(n,w) is the number of n-step self avoiding walks on a 3D cubic lattice confined between two infinite planes a distance w apart where the walk starts on one of the planes.

Original entry on oeis.org

5, 20, 21, 80, 92, 93, 304, 392, 408, 409, 1168, 1684, 1832, 1852, 1853, 4348, 7036, 8084, 8308, 8332, 8333, 16336, 29396, 35752, 37620, 37936, 37964, 37965, 60208, 120776, 155756, 168768, 171808, 172232, 172264, 172265, 223352, 497196, 677856, 758340, 782344, 786972, 787520, 787556, 787557
Offset: 1

Views

Author

Scott R. Shannon, Oct 11 2020

Keywords

Examples

			T(2,1) = 20 as after one step towards the opposite plane the walk must turn along that plane; this eliminates the 2-step straight walk in that direction, so the total number of walks is A116904(2) - 1 = 21 - 1 = 20.
The table begins:
5;
20,21;
80,92,93;
304,392,408,409;
1168,1684,1832,1852,1853;
4348,7036,8084,8308,8332,8333;
16336,29396,35752,37620,37936,37964,37965;
60208,120776,155756,168768,171808,172232,172264,172265;
223352,497196,677856,758340,782344,786972,787520,787556,787557;
817852,2026220,2920764,3379476,3545108,3586040,3592736,3593424,3593464,3593465;
		

Crossrefs

Cf. A338125 (start between planes), A116904 (w->infinity), A001412, A337023, A337400, A039648.

Formula

For w>=n, T(n,w) = A116904(n).

A335098 The number of constructible vertically balanced self-avoiding walks of length n on the upper half-plane of a 2D square lattice where the nodes and connecting rods have equal mass.

Original entry on oeis.org

3, 5, 11, 23, 51, 109, 251, 549, 1291, 2981, 7067, 16571, 39601, 94195, 226997, 544687, 1320935, 3194399, 7797891, 18996977, 46651387, 114353905, 282109663, 694793903, 1720327219, 4253521985, 10565387267, 26213565665, 65300013637, 162516950805, 405892537979
Offset: 1

Views

Author

Scott R. Shannon, Sep 12 2020

Keywords

Comments

This is a variation of A337860 where at every step, given the nodes and connecting rods have equal mass, the resulting 2D lattice structure is stable against toppling, assuming no sideways perturbations. See that sequence for further details of the allowed walks.

Examples

			a(1) = 3, a(2) = 5. These are the same stable walks as in A337860.
a(3) = 11. The constructible stable walks given a first step to the right are:
.
                                                   +
                        +      +---+   +---+       |
                        |      |           |       +
X---+---+---+   X---+---+  X---+       X---+       |
                                               X---+
.
These walks can also take a first step to the left thus, along with the directly vertical walk, the total number of stable walks is 2*5 + 1 = 11.
One 3-step walk which is not counted here, along with its parent 2-step walk, is:
.
+---+        +---+
|      ==>   |   |
X            X   +
.
After two steps the resulting structure is not stable against toppling, its center-of-mass is clearly to the right of the one node at y=0, thus any resulting 3-step walks resulting from this unstable 2-step walk are not counted.
		

Crossrefs

Showing 1-10 of 11 results. Next