Let (Formula presented.) denote the number of partitions of (Formula presented.) into parts that are not multiples of 3 or 5. We establish several infinite families of congruences modulo 2 for (Formula presented.). In the process, we also prove numerous parity results for broken 7-diamond partitions. © 2015 Australian Mathematical Publishing Association Inc
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the nu...
Let $b_l (n)$ denote the number of $l$-regular partitions of $n$ and $B_l (n)$ denote the number of ...
Andrews, Lewis and Lovejoy introduced a new class of partitions, partitions with designated summands...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
Recently, Dai proved new infinite families of congruences modulo 2 for broken 11-diamond partition f...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
Recently, Hirschhorn and the first author considered the parity of the function a(n) which counts th...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
Abstract. In this paper we prove several new parity results for broken k-diamond partitions introduc...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In a recent paper, Calkin, Drake, James, Law, Lee, Penniston and Radder use the theory of modular fo...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the nu...
Let $b_l (n)$ denote the number of $l$-regular partitions of $n$ and $B_l (n)$ denote the number of ...
Andrews, Lewis and Lovejoy introduced a new class of partitions, partitions with designated summands...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
Recently, Dai proved new infinite families of congruences modulo 2 for broken 11-diamond partition f...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
Recently, Hirschhorn and the first author considered the parity of the function a(n) which counts th...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
Abstract. In this paper we prove several new parity results for broken k-diamond partitions introduc...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In a recent paper, Calkin, Drake, James, Law, Lee, Penniston and Radder use the theory of modular fo...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the nu...
Let $b_l (n)$ denote the number of $l$-regular partitions of $n$ and $B_l (n)$ denote the number of ...
Andrews, Lewis and Lovejoy introduced a new class of partitions, partitions with designated summands...