2-dimensional array T(n, k) listed by antidiagonals for n >= 2, k >= 1 giving the number of acyclic paths of length k in the graph G(n) whose vertices are the integer lattice points (p, q) with 0 <= p, q < n and with an edge between v and w iff the line segment [v, w] contains no other integer lattice points.
A247944
2-dimensional array T(n, k) listed by antidiagonals for n >= 2, k >= 1 giving the number of acyclic paths of length k in the graph G(n) whose vertices are the integer lattice points (p, q) with 0 <= p, q < n and with an edge between v and w iff the line segment [v, w] contains no other integer lattice points.
Terms
- a(0) =12a(1) =24a(2) =56a(3) =24a(4) =304a(5) =172a(6) =0a(7) =1400a(8) =1696a(9) =400a(10) =0a(11) =5328a(12) =15580a(13) =6072a(14) =836a(15) =0a(16) =16032a(17) =132264a(18) =88320a(19) =18608a(20) =1496a(21) =0a(22) =35328a(23) =1029232a(24) =1225840a(25) =403156a(26) =44520a(27) =2564a(28) =0a(29) =49536
External references
- oeis: A247944