|
|
A214397
|
|
Triangle T(n,k) of the numbers of nodes in all non-extendable (complete) non-self-adjacent simple paths within a square lattice bounded by rectangles with nodal dimensions n and k, n >= k >= 2.
|
|
8
|
|
|
24, 76, 320, 188, 1040, 4608, 408, 2756, 18636, 104272, 832, 8368, 67952, 513460, 3349208, 1624, 21468, 228432, 2312112, 19845964, 152434216, 3080, 53108, 730772, 9943160, 113061272, 1125079096, 10676325280, 5716, 128072, 2261792, 41508164, 629214072, 8150708696, 99701732480, 1200653865056
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
The triangle of numbers is:
....k.....2......3.......4........5.........6..........7...........8.............9
.n
.2.......24
.3.......76....320
.4......188...1040....4608
.5......408...2756...18636...104272
.6......832...8368...67952...513460...3349208
.7.....1624..21468..228432..2312112..19845964..152434216
.8.....3080..53108..730772..9943160.113061272.1125079096.10676325280
.9.....5716.128072.2261792.41508164.629214072.8150708696.99701732480.1200653865056
Reading this triangle by rows gives the sequence.
|
|
LINKS
|
|
|
EXAMPLE
|
T(2,2) = The number of nodes in all complete non-self-adjacent simple paths within a 2 X 2 node rectangle.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|