A337031 -id:A337031 - cp's OEIS frontend

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.

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

Scott R. Shannon, Aug 11 2020

			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..

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.

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.

A336862 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 middle of the box's edge.

Original entry on oeis.org

4, 12, 4, 40, 14, 4, 118, 54, 14, 4, 358, 208, 56, 14, 4, 936, 826, 224, 56, 14, 4, 2600, 3232, 936, 226, 56, 14, 4, 6212, 12688, 3862, 956, 226, 56, 14, 4, 16068, 48924, 16196, 4026, 958, 226, 56, 14, 4, 34936, 187276, 67346, 17246, 4050, 958, 226, 56, 14, 4

Offset: 1

Scott R. Shannon, Aug 14 2020

			T(1,2) = 12. A first step along either edge leading to the corner leaves two possible second steps. A first step to the center of either face can be followed by a second step to three edges or to the center of the box, four steps in all. Thus the total number of 2-step walks is 2*2+2*4 = 12.
.
The table begins:
.
4 12 40 118 358  936  2600  6212  16068   34936   83708   163452    357056...
4 14 54 208 826 3232 12688 48924 187276  705196 2627950  9670620  35231628...
4 14 56 224 936 3862 16196 67346 282676 1180326 4950936 20646098  86165926...
4 14 56 226 956 4026 17246 73588 316456 1358518 5860464 25266192 109288486...
4 14 56 226 958 4050 17478 75288 327778 1425340 6236152 27260378 119641050...
4 14 56 226 958 4052 17506 75600 330362 1444544 6360718 28020896 123963354...
4 14 56 226 958 4052 17508 75632 330766 1448280 6391426 28238732 125405300...
4 14 56 226 958 4052 17508 75634 330802 1448788 6396618 28285548 125766436...
4 14 56 226 958 4052 17508 75634 330804 1448828 6397242 28292536 125835068...
4 14 56 226 958 4052 17508 75634 330804 1448830 6397286 28293288 125844228...
4 14 56 226 958 4052 17508 75634 330804 1448830 6397288 28293336 125845120...
4 14 56 226 958 4052 17508 75634 330804 1448830 6397288 28293338 125845172...
4 14 56 226 958 4052 17508 75634 330804 1448830 6397288 28293338 125845174...

Cf. A259808 (h->infinity), A335806 (h=1), A337023 (start at center of box), A337031 (start at center of face), A337035 (start at corner of box), A001412, A039648.

For n <= h, T(h,n) = A259808(n).
Row 1 = T(1,n) = A335806(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

Scott R. Shannon, Aug 12 2020

			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.

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.

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

A337035 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 h x h x h where the walk starts at one of the box's corners.

Original entry on oeis.org

3, 6, 3, 12, 9, 3, 18, 30, 9, 3, 30, 96, 33, 9, 3, 24, 294, 120, 33, 9, 3, 18, 840, 456, 123, 33, 9, 3, 0, 2214, 1662, 486, 123, 33, 9, 3, 0, 5796, 6018, 1908, 489, 123, 33, 9, 3, 0, 14112, 20784, 7584, 1944, 489, 123, 33, 9, 3, 0, 34158, 70470, 29754, 7932, 1947, 489, 123, 33, 9, 3

Offset: 1

Scott R. Shannon, Aug 12 2020

			T(2,3) = 30. After the first step along the cube's edge the walk can turn toward a face center in two ways. From the face center is has four available directions. If instead the walk takes two steps along the cube's edge to another corner it then has only two directions available for a third step. As the first step can be taken in three ways the total number of 3-step walks is 3*2*4+3*2 = 30.
.
The table begins:
.
3 6 12  18  30   24   18     0      0      0       0        0        0         0...
3 9 30  96 294  840 2214  5796  14112  34158   76062   167928   337476    670626...
3 9 33 120 456 1662 6018 20784  70470 231648  754386  2396832  7562730  23297826...
3 9 33 123 486 1908 7584 29754 115866 444096 1678560  6260082 23037330  84061494...
3 9 33 123 489 1944 7932 32298 132720 541908 2212542  8946288 36007908 143452686...
3 9 33 123 489 1947 7974 32766 136590 570570 2397384 10062258 42243138 176723826...
3 9 33 123 489 1947 7977 32814 137196 576168 2443284 10386522 44376156 189622260...
3 9 33 123 489 1947 7977 32817 137250 576930 2451066 10456566 44914830 193454916...
3 9 33 123 489 1947 7977 32817 137253 576990 2452002 10467042 45017580 194310204...
3 9 33 123 489 1947 7977 32817 137253 576993 2452068 10468170 45031314 194456058...
3 9 33 123 489 1947 7977 32817 137253 576993 2452071 10468242 45032652 194473668...
3 9 33 123 489 1947 7977 32817 137253 576993 2452071 10468245 45032730 194475234...
3 9 33 123 489 1947 7977 32817 137253 576993 2452071 10468245 45032733 194475318...
3 9 33 123 489 1947 7977 32817 137253 576993 2452071 10468245 45032733 194475321...

Cf. A039648 (h->infinity), A337034 (h=2), A337031 (start at center of face), A337032 (start as center of box), A336862 (start at middle of edge), A001412.

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

cp's OEIS Frontend

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.

Views

Author

Keywords

Examples

Crossrefs

Formula

A336862 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 middle of the box's edge.

Views

Author

Keywords

Examples

Crossrefs

Formula

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.

Views

Author

Keywords

Examples

Crossrefs

Formula

A337035 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 h x h x h where the walk starts at one of the box's corners.

Views

Author

Keywords

Examples

Crossrefs

Formula