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.
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.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =1a(5) =1a(6) =2a(7) =3a(8) =5a(9) =6a(10) =6a(11) =3a(12) =1a(13) =1a(14) =1a(15) =2a(16) =3a(17) =9a(18) =17a(19) =44a(20) =81a(21) =150a(22) =163a(23) =161a(24) =88a(25) =56a(26) =16a(27) =8a(28) =1a(29) =1
External references
- oeis: A385383