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.
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.
Terms
- a(0) =24a(1) =76a(2) =320a(3) =188a(4) =1040a(5) =4608a(6) =408a(7) =2756a(8) =18636a(9) =104272a(10) =832a(11) =8368a(12) =67952a(13) =513460a(14) =3349208a(15) =1624a(16) =21468a(17) =228432a(18) =2312112a(19) =19845964a(20) =152434216a(21) =3080a(22) =53108a(23) =730772a(24) =9943160a(25) =113061272a(26) =1125079096a(27) =10676325280a(28) =5716a(29) =128072
External references
- oeis: A214397