A note on the restricted partition function pA(n,k)
Abstract
Let A=(an)n∈N+ be a sequence of positive integers. Let pA(n,k) denote the number of multi-color partitions of n into parts in \a1,…,ak\. We examine several arithmetic properties of the sequence (pA(n,k) m)n∈N for an arbitrary fixed integer m≥slant2. We investigate periodicity of the sequence and lower and upper bounds for the density of the set \n∈N: pA(n,k) i m\ for a fixed positive integer k and i∈\0,1,…, m-1\. In particular, we apply our results to the special cases of the sequence A. Furthermore, we present some results related to restricted m-ary partitions.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.