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

A307387 a(n) is the number of canonical polygons with 4n alternating straight and diagonal edges.

Original entry on oeis.org

1, 9, 191, 8049, 418184, 24283599
Offset: 1

Views

Author

Lars Blomberg, Apr 18 2019

Keywords

Crossrefs

A307391 a(n) is the number of canonical polygons with 4n edges containing only right angles.

Original entry on oeis.org

2, 0, 2, 2, 8, 14, 62, 196, 892, 3788, 18098, 86302, 427340, 2136248
Offset: 1

Views

Author

Lars Blomberg, Apr 18 2019

Keywords

Comments

It appears that for the same sequence of angles there is one solution with all straight edges and one with all diagonal edges, so all terms are even.

Crossrefs

A307426 a(n) is the number of canonical polygons with 4n edges having 4-fold rotational symmetry.

Original entry on oeis.org

2, 2, 7, 22, 79, 289, 1145, 4655, 19314, 81242, 345785, 1484065, 6414999, 27895652
Offset: 1

Views

Author

Lars Blomberg, Apr 08 2019

Keywords

Crossrefs

A307454 a(n) is the number of canonical polygons with 2n edges having 2-fold rotational symmetry.

Original entry on oeis.org

1, 3, 9, 33, 123, 513, 2077, 8759, 37184, 159508, 688446, 2993451, 13082724
Offset: 2

Views

Author

Lars Blomberg, Apr 09 2019

Keywords

Crossrefs

A307455 a(n) is the number of canonical polygons with n edges having exactly 1 line of reflection symmetry.

Original entry on oeis.org

1, 0, 2, 2, 1, 7, 6, 28, 27, 107, 94, 488, 386, 2066, 1630, 8392, 6780, 34962, 28056, 147356, 117621, 622558, 500525, 2657666, 2149374
Offset: 3

Views

Author

Lars Blomberg, Apr 09 2019

Keywords

Comments

For n even, the symmetry line passes through two opposite vertices, or cuts through two opposite edges. For n odd it passes through one vertex and cuts the opposite edge. That explains the even-odd irregularity in the sequence.

Crossrefs

A307456 a(n) is the number of canonical polygons with 2n edges having exactly 2 lines of reflection symmetry.

Original entry on oeis.org

2, 2, 1, 4, 11, 24, 47, 99, 211, 437, 909, 1925
Offset: 2

Views

Author

Lars Blomberg, Apr 09 2019

Keywords

Crossrefs

A307519 a(n) is the number of canonical polygons with 4n edges having exactly 4 lines of reflection symmetry.

Original entry on oeis.org

2, 1, 2, 6, 10, 17, 34, 72, 142, 288, 585, 1195, 2413, 4898
Offset: 1

Views

Author

Lars Blomberg, Apr 12 2019

Keywords

Crossrefs

A336281 Total number of ways of embedding connected graphs with n edges in the square lattice with diagonals allowed.

Original entry on oeis.org

2, 6, 41, 318, 3108, 32243, 350575, 3896568
Offset: 1

Views

Author

James W. Anderson, Jul 15 2020

Keywords

Comments

The embedding must map edges in the graph onto either horizontal or vertical grid lines of length 1 or diagonals of length sqrt(2). Vertices in the graph must map onto lattice points, and of course must preserve the incidence structure of the graph. A square in the lattice may have both diagonals present - their intersection does not count as an incidence.
Configurations differing only a rotation or reflection are not counted as different.
The resulting figures are variously called 'polysticks', 'polyedges' or 'polyforms'.

Crossrefs

Without diagonal edges, we get A019988.
Cf. A052436.

Extensions

a(7)-a(8) from John Mason, Aug 17 2021
Showing 1-8 of 8 results.