Delannoy numbers are a type of combinatorial number that counts the number of different paths from the bottom-left corner to the top-right corner of an \( m \times n \) grid, where you can move only to the right, up, or diagonally up-right at each step. The Delannoy number \( D(m, n) \) represents the total number of such paths.
New to topics? Read the docs here!