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.
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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =2a(8) =3a(9) =4a(10) =4a(11) =2a(12) =1a(13) =1a(14) =1a(15) =1a(16) =2a(17) =5a(18) =10a(19) =23a(20) =44a(21) =80a(22) =87a(23) =86a(24) =49a(25) =32a(26) =10a(27) =5a(28) =1a(29) =1
External references
- oeis: A385385