{"version":"1.0","type":"rich","title":"crude combination solution","description":"This example prints a triangular table of binomial coefficients, displaying every combination value nCk for n from 0 up to a user-supplied integer. The output is generated by a recursive factorial function and a combination function that divides factorials, with each row showing increasing k values for a fixed n. The script validates input as non-negative integers and terminates with an error message otherwise, using Python’s built-in `input()`, `split()`, and `isdigit()` methods. The visualization is purely text-based, rendered to the console via `print()` statements with formatted strings.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-02a56a9a9c8430ff361173a4da4fcc4e?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}