A335353 - cp's OEIS frontend

A335353 Irregular table read by rows: Take a square and divide each of its sides into n equal parts giving a total of 4n nodes, draw straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

n	a(n)
1	4
2	16
3	8
4	0
5	0
6	0
7	1
8	32
9	5
10	32
11	40
12	8
13	0
14	0
15	1
16	64
17	28
18	16
19	0
20	0
21	0
22	0
23	0
24	0
25	1
26	80
27	56
28	24
29	8
30	0
31	0
32	0
33	0
34	0
35	0
36	0
37	0
38	0
39	1
40	96
41	84
42	24
43	0
44	0
45	0
46	0
47	0
48	0
49	1
50	128
51	100
52	40
53	20
54	0
55	0
56	0
57	0
58	0
59	0
60	0
61	0
62	0
63	1
64	144
65	156
66	32
67	0
68	8
69	0
70	0
71	0
72	0
73	0
74	0
75	0
76	0
77	0
78	0
79	0
80	0
81	1

[4, 16, 8, 0, 0, 0, 1, 32, 5, 32, 40, 8, 0, 0, 1, 64, 28, 16, 0, 0, 0, 0, 0, 0, 1, 80, 56, 24, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 96, 84, 24, 0, 0, 0, 0, 0, 0, 1, 128, 100, 40, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 144, 156, 32, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]

cp's OEIS Frontend

A335353 Irregular table read by rows: Take a square and divide each of its sides into n equal parts giving a total of 4n nodes, draw straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

Table of values

List of values

n	a(n)
1	4
2	16
3	8
4	0
5	0
6	0
7	1
8	32
9	5
10	32
11	40
12	8
13	0
14	0
15	1
16	64
17	28
18	16
19	0
20	0
21	0
22	0
23	0
24	0
25	1
26	80
27	56
28	24
29	8
30	0
31	0
32	0
33	0
34	0
35	0
36	0
37	0
38	0
39	1
40	96
41	84
42	24
43	0
44	0
45	0
46	0
47	0
48	0
49	1
50	128
51	100
52	40
53	20
54	0
55	0
56	0
57	0
58	0
59	0
60	0
61	0
62	0
63	1
64	144
65	156
66	32
67	0
68	8
69	0
70	0
71	0
72	0
73	0
74	0
75	0
76	0
77	0
78	0
79	0
80	0
81	1

n	a(n)
1	4
2	16
3	8
4	0
5	0
6	0
7	1
8	32
9	5
10	32
11	40
12	8
13	0
14	0
15	1
16	64
17	28
18	16
19	0
20	0
21	0
22	0
23	0
24	0
25	1
26	80
27	56
28	24
29	8
30	0
31	0
32	0
33	0
34	0
35	0
36	0
37	0
38	0
39	1
40	96
41	84
42	24
43	0
44	0
45	0
46	0
47	0
48	0
49	1
50	128
51	100
52	40
53	20
54	0
55	0
56	0
57	0
58	0
59	0
60	0
61	0
62	0
63	1
64	144
65	156
66	32
67	0
68	8
69	0
70	0
71	0
72	0
73	0
74	0
75	0
76	0
77	0
78	0
79	0
80	0
81	1

cp's OEIS Frontend

A335353 Irregular table read by rows: Take a square and divide each of its sides into n equal parts giving a total of 4*n nodes, draw straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

Table of values

List of values

A335353 Irregular table read by rows: Take a square and divide each of its sides into n equal parts giving a total of 4n nodes, draw straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

n	a(n)
1	4
2	16
3	8
4	0
5	0
6	0
7	1
8	32
9	5
10	32
11	40
12	8
13	0
14	0
15	1
16	64
17	28
18	16
19	0
20	0
21	0
22	0
23	0
24	0
25	1
26	80
27	56
28	24
29	8
30	0
31	0
32	0
33	0
34	0
35	0
36	0
37	0
38	0
39	1
40	96
41	84
42	24
43	0
44	0
45	0
46	0
47	0
48	0
49	1
50	128
51	100
52	40
53	20
54	0
55	0
56	0
57	0
58	0
59	0
60	0
61	0
62	0
63	1
64	144
65	156
66	32
67	0
68	8
69	0
70	0
71	0
72	0
73	0
74	0
75	0
76	0
77	0
78	0
79	0
80	0
81	1