T(n,k) = right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal at k points between start and finish.

A075435

T(n,k) = right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal at k points between start and finish.

Terms

    a(0) =2a(1) =6a(2) =4a(3) =20a(4) =24a(5) =8a(6) =70a(7) =116a(8) =72a(9) =16a(10) =252a(11) =520a(12) =456a(13) =192a(14) =32a(15) =924a(16) =2248a(17) =2496a(18) =1504a(19) =480a(20) =64a(21) =3432a(22) =9520a(23) =12624a(24) =9728a(25) =4480a(26) =1152a(27) =128a(28) =12870a(29) =39796

External references