A214504 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 3, n >= 2.
12, 14, 32, 36, 36, 48, 80, 88, 86, 100, 188, 210, 209, 228, 204, 204, 418, 470, 472, 524, 479, 452, 906, 1016, 1028, 1152, 1050, 1020, 1088, 980, 1943, 2170, 2219, 2472, 2250, 2222, 2333, 2200, 4137, 4610, 4754, 5260, 4811, 4738, 4929, 4784, 4920, 4924
Offset: 2
Examples
When n = 2, the number of times (NT) each node in the rectangle (N) occurs in a complete non-self-adjacent simple path is N 0 1 2 3 4 5 NT 12 14 12 12 14 12 To limit duplication, only the top left-hand corner 12 and the 14 to its right are stored in the sequence, i.e. T(2,1) = 12 and T(2,2) = 14.
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
Comment corrected by Christopher Hunt Gribble, Jul 22 2012
Comments