A078528 Number of unconstrained walks on square lattice trapped after n steps.
1, 1, 2, 5, 15, 30, 76, 170, 422, 961, 2339, 5390, 12977, 30059, 71918, 167019, 397691, 924931, 2194478, 5107991, 12085695, 28143758, 66442935, 154759821, 364706675, 849562628
Offset: 7
Examples
a(7)=1 because the unique shortest walk contains no constrained steps. a(10)=5: See illustration in "5 Unconstrained and 7 maximally 2-constrained walks of length 10" given at link.
Links
- Hugo Pfoertner, Results for the 2D Self-Trapping Random Walk
Programs
-
Fortran
c Program provided at given link
Extensions
a(24)-a(32) from Sean A. Irvine, Jul 03 2025
Comments