Partitions with parts in a finite set
Melvyn B. Nathanson
Abstract
Let A be a nonempty finite set of relatively prime positive integers, and let pA(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for pA(n).
Create a lesson
Related papers
An Infinite Family of Apéry-like Recurrences for Euler's Constant
Rotem Kalisch, Tali Monderer, Elyasheev Leibtag et al.
On the saturability of p-adic Lie groups
Casey Perdue
On Divisor Function Polynomials and Dirichlet Series
Martin N. Huxley, Matthew C. Lettington, Karl Michael Schmidt
On a conjecture on Romanoff type representations
Xiao-Hui Yan
Regularization of a Divergent Arithmetic Product via the Asymptotic Monoid: The Case of (-1)ω(n)
A. Alvarez Cruz, E. A. Alvarez Gutierrez
Appell Sequences in Analytic Number Theory: Shifted Expansions and Dirichlet L-Functions
Abdelmejid Bayad