In a recent note, Santos proved that the number of partitions of n using only odd parts equals the number of partitions of n of the form p1 + p2 + p3 + p4 + ... such that p1 ≥ p2 ≥ p3 ≥ p4 ≥ ··· ≥ 0 and p1 ≥ 2p2 + p3 + p4 + .... Via partition analysis, we extend this result by replacing the last inequality with p1 ≥ k2p2+k3p3+k4p4+..., where k2, k3, k4,... are nonnegative integers. Several applications of this result are mentioned in closing
Abstract.Let S denote a subset of the positive integers, and let pS(n) be the associated partition f...
© 2017 World Scientific Publishing Company. We study νk(n), the number of partitions of n into k par...
AbstractIf A is a set of positive integers, we denote by p(A,n) the number of partitions of n with p...
In recent years, numerous functions which count the number of parts of various types of partitions h...
In recent years, numerous functions which count the number of parts of various types of partitions h...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
AbstractLet p(n) denote the number of unrestricted partitions of n. For i=0, 2, let pi(n) denote the...
The theorem `` the number of partitions of a positive integer n into distinct odd parts equals the n...
A partition is a way that a number can be written as a sum of other numbers. For example, the number...
The parity of p(n), the ordinary partition function, has been studied for at least a century, yet it...
AbstractThe theorem “ the number of partitions of a positive integer n into distinct odd parts equal...
AbstractLet p(n) be the number of partitions of a non-negative integer n. In this paper we prove tha...
Let $R_2(n)$ denote the number of partitions of $n$ into parts that are odd or congruent to $\pm 2 \...
We study partitions of n into parts that occur at most thrice, with weights whose definition is m...
For P(n,k) equal to the partitions of n into k parts, in probability related investigations, it coul...
Abstract.Let S denote a subset of the positive integers, and let pS(n) be the associated partition f...
© 2017 World Scientific Publishing Company. We study νk(n), the number of partitions of n into k par...
AbstractIf A is a set of positive integers, we denote by p(A,n) the number of partitions of n with p...
In recent years, numerous functions which count the number of parts of various types of partitions h...
In recent years, numerous functions which count the number of parts of various types of partitions h...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
AbstractLet p(n) denote the number of unrestricted partitions of n. For i=0, 2, let pi(n) denote the...
The theorem `` the number of partitions of a positive integer n into distinct odd parts equals the n...
A partition is a way that a number can be written as a sum of other numbers. For example, the number...
The parity of p(n), the ordinary partition function, has been studied for at least a century, yet it...
AbstractThe theorem “ the number of partitions of a positive integer n into distinct odd parts equal...
AbstractLet p(n) be the number of partitions of a non-negative integer n. In this paper we prove tha...
Let $R_2(n)$ denote the number of partitions of $n$ into parts that are odd or congruent to $\pm 2 \...
We study partitions of n into parts that occur at most thrice, with weights whose definition is m...
For P(n,k) equal to the partitions of n into k parts, in probability related investigations, it coul...
Abstract.Let S denote a subset of the positive integers, and let pS(n) be the associated partition f...
© 2017 World Scientific Publishing Company. We study νk(n), the number of partitions of n into k par...
AbstractIf A is a set of positive integers, we denote by p(A,n) the number of partitions of n with p...