A213433 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 3, n >= 2.
2, 4, 2, 2, 4, 6, 0, 4, 2, 4, 10, 18, 8, 8, 14, 2, 4, 10, 22, 34, 22, 36, 22, 18, 2, 4, 10, 22, 38, 56, 68, 80, 58, 34, 24, 2, 2, 4, 10, 22, 38, 60, 110, 138, 188, 106, 108, 54, 36, 4, 2, 4, 10, 22, 38, 60, 114, 188, 280, 360, 248, 254, 174, 84, 52, 6, 2, 4, 10, 22, 38, 60, 114, 192, 338, 494, 694, 534, 642, 402, 282, 130, 72, 8
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 3 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.
Extensions
Added new comment.
Comments