Abstract
A generalized Frobenius partition of [Formula: see text] with [Formula: see text] colors is a two-rowed array [Formula: see text] where [Formula: see text], and the integer entries are taken from [Formula: see text] distinct copies of the non-negative integers distinguished by color, and the rows are ordered first by size and then by color with no two consecutive like entries in any row. Let [Formula: see text] denote the number of this kind of partitions of [Formula: see text] with [Formula: see text] colors. In this paper, we establish some congruences modulo powers of 2 for [Formula: see text].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.