Array read by antidiagonals: consider a doubly infinite chessboard with squares labeled (i,j), i in Z, j in Z; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).
A114972
Array read by antidiagonals: consider a doubly infinite chessboard with squares labeled (i,j), i in Z, j in Z; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =1a(5) =3a(6) =7a(7) =2a(8) =2a(9) =7a(10) =19a(11) =6a(12) =1a(13) =6a(14) =19a(15) =51a(16) =16a(17) =3a(18) =3a(19) =16a(20) =51a(21) =141a(22) =45a(23) =10a(24) =1a(25) =10a(26) =45a(27) =141a(28) =393a(29) =126
External references
- oeis: A114972