A001409 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A001409

Number of 2n-step polygons on cubic lattice.
(Formerly M3095 N1254)

1, 0, 3, 22, 207, 2412, 31754, 452640, 6840774, 108088232, 1768560270, 29764630632, 512705615350, 9005206632672, 160810554015408, 2912940755956084, 53424552150523386

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

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

Table of n, a(n) for n=0..16.

N. Clisby, R. Liang, and G. Slade, Self-avoiding walk enumeration via the lace expansion, J. Phys. A: Math. Theor., 40 (2007), pp. 10973-11017, Table A5.

G. S. Rushbrooke and J. Eve, High-temperature Ising partition function and related noncrossing polygons for the simple cubic lattice, J. Math. Physics, 3 (1962), pp. 185-189.

CROSSREFS

Cf. A001412.

Sequence in context: A376575 A006783 A330668 * A260154 A340474 A079489

Adjacent sequences: A001406 A001407 A001408 * A001410 A001411 A001412

KEYWORD

nonn,walk,more

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from R. J. Mathar, Aug 31 2007

STATUS

approved