A213476 Irregular array T(n,k) of the numbers of distinct shapes under rotation of the non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.
2, 4, 6, 10, 14, 20, 26, 18, 2, 2, 4, 10, 22, 38, 60, 110, 138, 188, 106, 108, 54, 36, 4, 2, 4, 10, 22, 50, 104, 194, 300, 444, 542, 840, 650, 1056, 808, 1144, 354, 292, 16, 2, 4, 10, 22, 50, 104, 234, 460, 778, 894, 1540, 1812, 3444, 3512, 8294, 6104, 13914, 5778, 5548, 2216, 710, 24
Offset: 2
Examples
T(2,3) = The number of distinct shapes under rotation of the complete non-self-adjacent simple paths of length 3 nodes within a square lattice bounded by a 2 X 7 node rectangle.
Links
- C. H. Gribble, Computed characteristics of complete non-self-adjacent paths in a square lattice bounded by various sizes of rectangle.
- C. H. Gribble, Computes characteristics of complete non-self-adjacent paths in square and cubic lattices bounded by various sizes of rectangle and rectangular cuboid respectively.
Comments