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-3 of 3 results.

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.

Crossrefs

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.

Crossrefs

A346131 Numbers m such that no self-avoiding walk that can make turns from the set +-Pi/11, +-3*Pi/11, +-5*Pi/11, +-7*Pi/11, +-9*Pi/11, 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, 4, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41
Offset: 1

Views

Author

Hugo Pfoertner and Markus Sigg, Aug 01 2021

Keywords

Comments

Although closed walks (see A316201) 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 < 3.53.
		

Crossrefs

Cf. A346123-A346132 similar to this sequence with other sets of turning angles.
Showing 1-3 of 3 results.