A330662 -id:A330662 - cp's OEIS frontend

A358328 Triangle read by rows: T(n,k) is the number of polygons with 2n sides, of which k run through the center of a circle, on the circumference of which the 2n vertices of the polygon are arranged at equal spacing, up to rotation.

0, 0, 1, 1, 0, 1, 4, 4, 4, 2, 98, 120, 84, 24, 6, 5648, 6912, 4032, 1344, 288, 40, 532344, 631680, 351360, 118408, 26400, 3840, 322, 72724122, 84211200, 45907200, 15436800, 3513600, 552960, 57600, 3294, 13577195574, 15432560640, 8305920000, 2786273280, 643507200, 106122240, 12418560, 967680, 40320

Offset: 0

Ludovic Schwob, Nov 09 2022

By "2*n-sided polygons" we mean the polygons that can be drawn by connecting 2*n equally spaced points on a circle.
T(0,0)=0 and T(0,1)=1 by convention.
The sequence is limited to even-sided polygons, since all odd-sided polygons have no side passing through the center.

			Triangle begins:
    0;
    0,   1;
    1,   0,   1;
    4,   4,   4,   2;
   98, 120,  84,  24,   6;

Ludovic Schwob, Table of n, a(n) for n = 0..5150

Row sums give A094155(n).

Cf. A330662.

A358329 Triangle read by rows: T(n,k) is the number of polygons with 2n sides, of which k run through the center of a circle, on the circumference of which the 2n vertices of the polygon are arranged at equal spacing, up to rotation and reflection.

Original entry on oeis.org

0, 0, 1, 1, 0, 1, 4, 3, 3, 2, 70, 60, 54, 12, 6, 2980, 3512, 2088, 704, 156, 28, 268444, 315840, 176928, 59204, 13488, 1920, 193, 36387789, 42112416, 22965696, 7722144, 1759104, 277344, 28992, 1743, 6789078267, 7716280320, 4153217280, 1393136640, 321814080, 53061120, 6216960, 483840, 20640

Offset: 0

Ludovic Schwob, Nov 09 2022

By "2*n-sided polygons" we mean the polygons that can be drawn by connecting 2*n equally spaced points on a circle.
T(0,0)=0 and T(0,1)=1 by convention.
The sequence is limited to even-sided polygons, since all odd-sided polygons have no side passing through the center.

			Triangle begins:
    0;
    0,   1;
    1,   0,   1;
    4,   3,   3,   2;
   70,  60,  54,  12,   6;

Ludovic Schwob, Table of n, a(n) for n = 0..5150

Row sums give A094157(n).

Cf. A330662.

cp's OEIS Frontend

A358328 Triangle read by rows: T(n,k) is the number of polygons with 2n sides, of which k run through the center of a circle, on the circumference of which the 2n vertices of the polygon are arranged at equal spacing, up to rotation.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A358329 Triangle read by rows: T(n,k) is the number of polygons with 2n sides, of which k run through the center of a circle, on the circumference of which the 2n vertices of the polygon are arranged at equal spacing, up to rotation and reflection.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

cp's OEIS Frontend

A358328 Triangle read by rows: T(n,k) is the number of polygons with 2*n sides, of which k run through the center of a circle, on the circumference of which the 2*n vertices of the polygon are arranged at equal spacing, up to rotation.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A358329 Triangle read by rows: T(n,k) is the number of polygons with 2*n sides, of which k run through the center of a circle, on the circumference of which the 2*n vertices of the polygon are arranged at equal spacing, up to rotation and reflection.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A358328 Triangle read by rows: T(n,k) is the number of polygons with 2n sides, of which k run through the center of a circle, on the circumference of which the 2n vertices of the polygon are arranged at equal spacing, up to rotation.

A358329 Triangle read by rows: T(n,k) is the number of polygons with 2n sides, of which k run through the center of a circle, on the circumference of which the 2n vertices of the polygon are arranged at equal spacing, up to rotation and reflection.