Abstract

Let \(\alpha \) and \(\beta \) be two nonnegative integers such that \(\beta < \alpha \). For an arbitrary sequence \(\{a_n\}_{n\geqslant 1}\) of complex numbers, we investigate linear combinations of the form \(\sum _{k\geqslant 1} S(\alpha k-\beta ,n) a_k\), where S(k, n) is the total number of k’s in all the partitions of n into parts not congruent to 2 modulo 4. The general nature of the numbers \(a_n\) allows us to provide new connections between partitions and functions from multiplicative number theory.

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 call

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.