A316198 - 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

A316198

Number of self-avoiding polygons with perimeter 2*n and sides = 1 that have vertex angles from the set 0, +-Pi/4, +-Pi/2, +-3*Pi/4, not counting rotations and reflections as distinct.

0, 2, 6, 59, 695, 12198

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

OFFSET

1,2

COMMENTS

Holes are excluded, i.e., the boundary path may nowhere touch or intersect itself.

LINKS

Table of n, a(n) for n=1..6.

Contest Organizers, Al Zimmermann's Programming Contests - Snakes on a Plane, Fall 2006.

Hugo Pfoertner, Illustration of polygons of perimeter <= 10.

CROSSREFS

Cf. A306178, A316195, A316197.