Irregular triangle read by rows: T(n,k) is the number of polysticks of size k, i.e., connected subsets of k edges, 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 <= 2*n^2.
A385390
Irregular triangle read by rows: T(n,k) is the number of polysticks of size k, i.e., connected subsets of k edges, 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 <= 2*n^2.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =7a(6) =4a(7) =4a(8) =1a(9) =1a(10) =1a(11) =2a(12) =5a(13) =14a(14) =38a(15) =111a(16) =261a(17) =500a(18) =654a(19) =648a(20) =486a(21) =305a(22) =144a(23) =61a(24) =19a(25) =6a(26) =1a(27) =1a(28) =1a(29) =2
External references
- oeis: A385390