|
|
A174319
|
|
Number of n-step walks on cubic lattice (no points repeated, no adjacent points unless consecutive in path).
|
|
12
|
|
|
1, 6, 30, 126, 534, 2214, 9246, 38142, 157974, 649086, 2675022, 10966470, 45054630, 184400910, 755930958, 3089851782, 12645783414, 51635728518, 211059485310, 861083848998, 3516072837894, 14334995983614, 58485689950254
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Fisher and Hiley give 2674926 as their last term instead of 2675022 (see A002934). Douglas McNeil confirms the correction on the seqfan list.
In the notation of Nemirovsky et al. (1992), a(n), the n-th term of the current sequence is C_{n,m} with m=0 (and d=3). Here, for a d-dimensional hypercubic lattice, C_{n,m} is "the number of configurations of an n-bond self-avoiding chain with m neighbor contacts." (Let n >= 1. For d=2, we have C(n,0) = A173380(n); for d=4, we have C(n,0) = A034006(n); and for d=5, we have C(n,0) = A038726(n).) - Petros Hadjicostas, Jan 03 2019
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,walk,nice,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|