A289343 a(n) = A289191(prime(n)).

2, 4, 112, 11292, 740754220, 361711410384, 222595582448849152, 258327454310582805036, 661821993709898403923269564, 10266982973657640119698928948136690256, 34586475747666402744018445215769168804860, 2847089959666118831608487671650698855934142888811472

Offset: 1

Author

Marko Riedel, Jul 02 2017

Keywords

• nonn

Comments

The case n=2 is a degenerate polygon (two sides connecting two vertices). The two possibilities are when the edges cross and do not cross. Polygons start at n=3 with a triangle.

Links

• Marko Riedel, Hexagonal tiles.
• Marko Riedel, Maple code for number of tiles using Burnside lemma.

Crossrefs

Cf. A289191.

Formula

a(n) = A289191(prime(n))