Abstract
In 2014, Slavik presented a recursive method to find closed forms for two kinds of sums involving squares of binomial coefficients. We give an elementary and explicit approach to compute these two kinds of sums. It is based on a triangle of numbers which is akin to the Stirling subset numbers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
