A214510 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 4, n >= 2.
23, 24, 80, 86, 88, 100, 264, 303, 303, 282, 820, 1008, 1007, 907, 1058, 776, 2401, 3043, 3013, 2844, 3312, 2375, 6751, 8651, 8562, 8317, 9411, 7116, 9718, 6882, 18630, 24035, 23979, 23261, 26077, 20216, 26479, 20016, 50775, 65977, 66474, 63790, 72137, 55400, 71469, 55907, 69764, 57274
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 6 7 NT 23 24 24 23 23 24 24 23 To limit duplication, only the top left-hand corner 23 and the 24 to its right are stored in the sequence, i.e. T(2,1) = 23 and T(2,2) = 24.
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