A385385 - cp's OEIS frontend

A385385 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, as well as interchange of rows and columns; 1 <= k <= n^2.

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	2
9	3
10	4
11	4
12	2
13	1
14	1
15	1
16	1
17	2
18	5
19	10
20	23
21	44
22	80
23	87
24	86
25	49
26	32
27	10
28	5
29	1
30	1
31	1
32	1
33	2
34	5
35	12
36	32
37	88
38	249
39	675
40	1699
41	3747
42	6993
43	10538
44	12531
45	11580
46	8458
47	4975
48	2378
49	943
50	305
51	87
52	19
53	5
54	1
55	1

[1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 4, 2, 1, 1, 1, 1, 2, 5, 10, 23, 44, 80, 87, 86, 49, 32, 10, 5, 1, 1, 1, 1, 2, 5, 12, 32, 88, 249, 675, 1699, 3747, 6993, 10538, 12531, 11580, 8458, 4975, 2378, 943, 305, 87, 19, 5, 1, 1]

cp's OEIS Frontend

A385385 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, as well as interchange of rows and columns; 1 <= k <= n^2.

Table of values

List of values