login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001409 Number of 2n-step polygons on cubic lattice.
(Formerly M3095 N1254)
0
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

Sequence in context: A098618 A207326 A006783 * A260154 A079489 A190526

Adjacent sequences:  A001406 A001407 A001408 * A001410 A001411 A001412

KEYWORD

nonn,walk,more,changed

AUTHOR

N. J. A. Sloane

EXTENSIONS

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 14:12 EST 2019. Contains 319225 sequences. (Running on oeis4.)