cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

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.

Original entry on oeis.org

0, 2, 6, 59, 695, 12198
Offset: 1

Views

Author

Hugo Pfoertner, Jul 04 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A306178, A316195, A316197.

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

Original entry on oeis.org

0, 0, 8, 17, 472, 7042
Offset: 1

Views

Author

Hugo Pfoertner, Jul 04 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A306179, A316195, A316197, A316198.

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

Original entry on oeis.org

0, 0, 1, 3, 4, 22, 69, 418, 2210, 14024
Offset: 1

Views

Author

Hugo Pfoertner, Jul 07 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A258206, A266549, A284869, A306182, A316195, A316197, A316198, A316199, A316200, A316201.

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

Original entry on oeis.org

0, 0, 0, 2, 2, 10, 15, 124, 352, 2378, 19405
Offset: 1

Views

Author

Hugo Pfoertner, Jul 07 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A258206, A266549, A284869, A306180, A316192, A316195, A316197, A316198, A316199, A316201.

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

Original entry on oeis.org

0, 0, 8, 19, 720, 10578
Offset: 1

Views

Author

Hugo Pfoertner, Jul 07 2018

Keywords

Comments

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

Links

Crossrefs

Cf. A258206, A266549, A284869, A306181, A316192, A316195, A316197, A316198, A316199, A316200.

A346127 Numbers m such that no self-avoiding walk that can make turns from the set +-Pi/7, +-3*Pi/7, +-5*Pi/7, of length m + 1 fits into the smallest circle that can enclose a walk of length m.

Original entry on oeis.org

1, 2, 3, 5, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 28, 29, 30, 31, 35, 37, 38, 39, 40, 41, 42, 43, 45, 47, 48
Offset: 1

Views

Author

Hugo Pfoertner and Markus Sigg, Aug 01 2021

Keywords

Comments

Although closed walks (see A316197) would be allowed, no closed walk that fits into a smaller enclosing circle than any open walk of the same length is known.

Examples

			See link for illustrations of terms corresponding to diameters D < 4.126.

Links

Crossrefs

Cf. A127399, A127400, A127401, A306177, A316197.
Cf. A346123-A346132 similar to this sequence with other sets of turning angles.
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.