Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2*n+2, read by rows, where T(n,k) is the number of 2*(k+2*n-2)-cycles in the n X n grid graph which pass through NW and SE corners ((0,0),(n-1,n-1)).
A333667
Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2*n+2, read by rows, where T(n,k) is the number of 2*(k+2*n-2)-cycles in the n X n grid graph which pass through NW and SE corners ((0,0),(n-1,n-1)).
Terms
- a(0) =1a(1) =3a(2) =20a(3) =16a(4) =6a(5) =175a(6) =420a(7) =562a(8) =456a(9) =186a(10) =1764a(11) =8064a(12) =21224a(13) =39500a(14) =55376a(15) =57248a(16) =37586a(17) =10260a(18) =1072a(19) =19404a(20) =138600a(21) =569768a(22) =1717152a(23) =4151965a(24) =8371428a(25) =14126846a(26) =19364732a(27) =20241450a(28) =14759356a(29) =6998166
External references
- oeis: A333667