Abstract
We use the Z-transform to solve a type of recurrence relation satisfied by the number of representations of an integer n as the sum of squares and as the sum of triangular numbers, and also by the color partitions of n; the corresponding solution is in terms of the complete Bell polynomials.
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 callMore From: European Journal of Theoretical and Applied Sciences
Disclaimer: 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.
