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.

A343369 Triangle read by rows: T(n,k) is the number of polygons formed by connecting the vertices of a regular 2n-gon such that the winding number around the center is k and with no side passing through the center.

Table of values

n a(n)
1 0
2 0
3 1
4 6
5 10
6 0
7 296
8 391
9 56
10 1
11 21580
12 28298
13 6132
14 246
15 0
16 2317884
17 3137098
18 859536
19 70389
20 1012
21 1
22 349281380
23 490054052
24 158307216
25 19756138
26 711692
27 4082
28 0
29 70651004192
30 102443715659
31 37521267472
32 6221752657
33 390266848
34 6782563
35 16368
36 1

List of values

[0, 0, 1, 6, 10, 0, 296, 391, 56, 1, 21580, 28298, 6132, 246, 0, 2317884, 3137098, 859536, 70389, 1012, 1, 349281380, 490054052, 158307216, 19756138, 711692, 4082, 0, 70651004192, 102443715659, 37521267472, 6221752657, 390266848, 6782563, 16368, 1]