A Delannoy number D describes the number of paths from the southwest corner (0, 0) of a rectangular grid to the northeast corner (m, n), using only single steps north, northeast, or east.
It is necessary to download locally this repository, then you can open the .m scripts using MatLab ou Octave.
Run the Delannoy.m and provide the values asked by the script.
-
Fork it!
-
Create your feature branch:
git checkout -b my-new-feature -
Commit your changes:
git commit -am 'Add some feature' -
Push to the branch:
git push origin my-new-feature -
Submit a pull request :D
More details about the Delannoy number can be found in the following links:
http://mathworld.wolfram.com/DelannoyNumber.html
https://en.m.wikipedia.org/wiki/Delannoy_number
MIT