Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A213379
Irregular array T(n,k) of numbers/2 of non-extendable (complete) non-self-adjacent simple paths of each length within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.
6
4, 4, 6, 10, 14, 16, 8, 4, 8, 16, 22, 48, 60, 82, 90, 66, 34, 24, 2, 4, 8, 20, 40, 78, 116, 192, 180, 354, 278, 530, 268, 546, 124, 32, 4, 8, 20, 44, 106, 172, 322, 410, 612, 602, 1462, 1122, 3240, 1712, 4682, 1394, 706, 218, 4
OFFSET
2,1
COMMENTS
The irregular array of numbers is:
...k..3....4....5....6....7....8....9...10...11...12...13...14...15...16...17...18...19...20...21
.n
.2....4....4....6...10...14...16....8
.3....4....8...16...22...48...60...82...90...66...34...24....2
.4....4....8...20...40...78..116..192..180..354..278..530..268..546..124...32
.5....4....8...20...44..106..172..322..410..612..602.1462.1122.3240.1712.4682.1394..706..218....4
where k is the path length in nodes. In an attempt to define the irregularity of the array, it appears that the maximum value of k is 4n - floor((n-8)/4) for n >= 8. Reading this array by rows gives the sequence. One half of the numbers of paths constitute the sequence to remove the effect of the bilateral symmetry of the rectangle.
EXAMPLE
T(2,3) = One half of the number of complete non-self-adjacent simple paths of length 3 nodes within a square lattice bounded by a 2 X 6 node rectangle.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
STATUS
approved