|
|
|
|
1, 3, 14, 39, 134, 362, 1114, 2974, 8715, 23192, 66131, 175889, 493036, 1311265, 3633777, 9664070, 26564611, 70644166, 193023433, 513251110, 1395938840, 3711196199, 10057272214, 26732694893, 72234863272, 191962874523, 517473126631, 1374873851835
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
7,2
|
|
COMMENTS
|
Partial sums of number of self-avoiding walks on square lattice trapped after n steps.
A self-trapping walk is a walk which ends when the walker is "trapped" or surrounded by previously visited sites on the lattice.
|
|
REFERENCES
|
B. D. Hughes, Random Walks and Random Environments, Vol. I OUP, 1995.
N. Madras & G. Slade, The Self-Avoiding Walk, Birkhäuser, 1993.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(16) = 1 + 2 + 11 + 25 + 95 + 228 + 752 + 1860 + 5741 + 14477 = 23192.
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|