A377162
a(n) is the denominator corresponding to A377161(n).
Original entry on oeis.org
1953125, 9765625, 58593750, 976562500, 4687500000000, 1687500000000000, 22500000000000000, 75000000000000000, 194400000000000000000
Offset: 11
A377161(n)/a(n) for n = 11, 12, ... : 8/1953125, 38/9765625, 637/58593750, 9759/976562500, 86221819/4687500000000, 28522360751/1687500000000000, 583791967829/22500000000000000, ...
A377161 are the corresponding numerators.
A077817
Number of self-avoiding walks on the cubic lattice trapped after n steps.
Original entry on oeis.org
5, 20, 229, 921, 7156, 29567, 193932, 821797, 4902336, 21201528, 119162697, 523550761
Offset: 11
A077818
a(n) is the numerator of the probability P(n) of the occurrence of a 3-dimensional self-trapping walk of length n.
Original entry on oeis.org
40, 190, 15925, 48795, 86221819, 28522360751, 583791967829, 1801511107253, 32337280749408865
Offset: 11
a(13)=15925, A077819(13)=A077820(13)=1 because there are 5 different probabilities for the 1832 (=8*A077817(13)) walks: 256 walks with probability p1=1/125000000, 88 with p2=1/146484375, 600 with p3=1/156250000, 728 with p4=1/146484375 and 160 with p5=1/244140625. P(13)=256*p1+88*p2+600*p3+728*p4+160*p5=637/(6*5^10)=25*637/(5^12*6)= 15295/(5^(13-1)*3^1*2^1)
- See under A001412.
- More references are given in the sci.math NG posting in the second link.
A077819
a(n) is the exponent of 3 in the denominator of the probability P(n) of the occurrence of a 3-dimensional self-trapping walk of length n.
Original entry on oeis.org
0, 0, 1, 0, 1, 3, 2, 1, 5
Offset: 11
A077820
a(n) is the exponent of 2 in the denominator of the probability P(n) of the occurrence of a 3-dimensional self-trapping walk of length n.
Original entry on oeis.org
0, 0, 1, 2, 8, 11, 14, 15, 20
Offset: 11
A378903
Decimal expansion of the expected number of steps to termination by self-trapping of a self-avoiding random walk on the cubic lattice.
Original entry on oeis.org
- Martin Z. Bazant, Topics in Random Walks and Diffusion, Graduate course 18.325, Spring 2001 at the Massachusetts Institute for Technology.
- Martin Z. Bazant, Topics in Random Walks and Diffusion, Problem Sets for Spring 2001. In the no longer available solutions to Problem Set 2b, Dion Harmon gave 3960 using 10^5 walks, and E.C.Silva gave 3676 using 1.5*10^4 walks.
- Martin Z. Bazant, Problem Set 2 for Graduate course 18.325, local pdf version of postscript file. Problem 5. Self-Trapping Walk.
- Hugo Pfoertner, Probability density for the number of steps before trapping occurs, based on 27*10^9 simulated walks (2024).
Showing 1-6 of 6 results.
Comments