|
|
A001413
|
|
Number of 2n-step polygons on cubic lattice.
(Formerly M5154 N2238)
|
|
7
|
|
|
0, 24, 264, 3312, 48240, 762096, 12673920, 218904768, 3891176352, 70742410800, 1309643747808, 24609869536800, 468270744898944, 9005391024862848, 174776445357365040, 3419171337633496704
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) is the number of 2n-step closed self-avoiding paths on the cubic lattice. - Bert Dobbelaere, Jan 04 2019
|
|
REFERENCES
|
B. D. Hughes, Random Walks and Random Environments, Oxford 1995, vol. 1, p. 462.
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
|
Cf. A010566 (for square lattice equivalent).
Cf. A002896 (without self-avoidance restriction).
|
|
KEYWORD
|
nonn,walk,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|