A385383 - cp's OEIS frontend

A385383 Irregular triangle read by rows: T(n,k) is the number of polyominoes of size k, i.e., connected subsets of k square cells (or vertices), of the n X n flat torus, up to cyclic shifts and reflections of rows and columns; 1 <= k <= n^2.

n	a(n)
1	1
2	1
3	2
4	1
5	1
6	1
7	2
8	3
9	5
10	6
11	6
12	3
13	1
14	1
15	1
16	2
17	3
18	9
19	17
20	44
21	81
22	150
23	163
24	161
25	88
26	56
27	16
28	8
29	1
30	1
31	1
32	2
33	3
34	9
35	21
36	62
37	168
38	490
39	1324
40	3370
41	7433
42	13905
43	20961
44	24927
45	23008
46	16766
47	9825
48	4669
49	1831
50	576
51	157
52	32
53	8
54	1
55	1

[1, 1, 2, 1, 1, 1, 2, 3, 5, 6, 6, 3, 1, 1, 1, 2, 3, 9, 17, 44, 81, 150, 163, 161, 88, 56, 16, 8, 1, 1, 1, 2, 3, 9, 21, 62, 168, 490, 1324, 3370, 7433, 13905, 20961, 24927, 23008, 16766, 9825, 4669, 1831, 576, 157, 32, 8, 1, 1]

cp's OEIS Frontend

A385383 Irregular triangle read by rows: T(n,k) is the number of polyominoes of size k, i.e., connected subsets of k square cells (or vertices), of the n X n flat torus, up to cyclic shifts and reflections of rows and columns; 1 <= k <= n^2.

Table of values

List of values