OFFSET
2,1
COMMENTS
The subset of nodes is contained in the top left-hand quarter of the rectangle and has nodal dimensions floor((n+1)/2) and 4 to capture all geometrically distinct counts.
The quarter-rectangle is read by rows.
The irregular array of numbers is:
...k.....1.....2.....3.....4.....5.....6.....7.....8.....9....10....11....12
.n
.2......52.....0.....0.....0
.3.....353....57....62....60....10.....0.....0.....0
.4....1931...495...622...602...200....56...262...364
.5...12027..3522..4399..4170..2143...640..1941..2394..2612...954..3956..5136
.6...76933.21068.26181.25090.17601..3675..9258.10048.20009..7213.26414.32132
where k indicates the position of the end node in the quarter-rectangle.
For each n, the maximum value of k is 4*floor((n+1)/2).
Reading this array by rows gives the sequence.
LINKS
EXAMPLE
When n = 2, the number of times (NT) each node in the rectangle is the end node (EN) of a complete non-self-adjacent simple path is
EN 0 1 2 3 4 5 6
7 8 9 10 11 12 13
NT 52 0 0 0 0 0 52
52 0 0 0 0 0 52
To limit duplication, only the top left-hand corner 52 and the three zeros to its right are stored in the sequence, i.e. T(2,1) = 31, T(2,2) = 0, T(2,3) = 0 and T(2,4) = 0.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Christopher Hunt Gribble, Jul 14 2012
EXTENSIONS
Comment corrected by Christopher Hunt Gribble, Jul 22 2012
STATUS
approved