Let pod(n) denote the number of partitions of an integer n wherein the odd parts are distinct. Recently, a number of congruences for pod(n) have been established. In this paper, we establish the generating function of pod(5n + 2) and then prove new infinite families of congruences modulo 5 and 9 for pod(n) by using the formulas for t3(n) and t5(n), where tk(n) is the number of representations of n as a sum of k triangular numbers. In particular, we generalize a congruence for pod(n) due to Radu and Sellers. Mathematics Subject Classification (2010): 05A17, 11P83
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...
The arithmetic properties of the ordinary partition function p(n) have been the topic of intensive s...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the nu...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
Andrews, Lewis and Lovejoy introduced a new class of partitions, partitions with designated summands...
In this work, we consider the function ped(n), the number of partitions of an integer n wherein the ...
In this work, we consider the function ped(n), the number of partitions of an integer n wherein the ...
Let (Formula presented.) denote the number of partitions of (Formula presented.) into parts that are...
In his work with the partition function, Ramanujan observed several congru-ences of the form p(An + ...
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 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...
The arithmetic properties of the ordinary partition function p(n) have been the topic of intensive s...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the nu...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
Andrews, Lewis and Lovejoy introduced a new class of partitions, partitions with designated summands...
In this work, we consider the function ped(n), the number of partitions of an integer n wherein the ...
In this work, we consider the function ped(n), the number of partitions of an integer n wherein the ...
Let (Formula presented.) denote the number of partitions of (Formula presented.) into parts that are...
In his work with the partition function, Ramanujan observed several congru-ences of the form p(An + ...
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 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...
The arithmetic properties of the ordinary partition function p(n) have been the topic of intensive s...