On the counting function of the sets of parts A such that the partition function p( A,n) takes even values for n large enough
DOI10.1016/J.DISC.2005.11.022zbMATH Open1109.05019OpenAlexW2106772779MaRDI QIDQ2497489FDOQ2497489
Authors: Houda Lahouar, Fethi Ben Saïd, Jean-Louis Nicolas
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.022
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sur une application de la formule de Selberg–Delange
- Approximate formulas for some functions of prime numbers
- On the parity of additive representation functions
- Partitions functions with periodic parity
- Even partition functions
- On some sets with even valued partition function
- Title not available (Why is that?)
- Sets of parts such that the partition function is even
- On the parity of generalized partition functions. II
- On a conjecture of Nicolas-Sárközy about partitions
- Sur un théorème de Mertens. (On a theorem of Mertens)
Cited In (13)
- On the counting function of sets with even partition functions
- Title not available (Why is that?)
- On some sets with even partition functions
- The number of parts in the (distinct) partitions with parts from a set
- Modular parts of a function
- ON SETS SUCH THAT THE PARTITION FUNCTION IS EVEN FROM A CERTAIN POINT ON
- On the parity of generalized partition functions. III
- PARTITIONS WITH PARTS IN A FINITE SET
- On the elements of sets with even partition function
- Sets with even partition functions and 2-adic integers
- Note on partitions into polynomials with number of parts in an arithmetic progression
- Counting Even and Odd Partitions
- On some sets with even valued partition function
This page was built for publication: On the counting function of the sets of parts \(\mathcal A\) such that the partition function \(p(\mathcal {A},n)\) takes even values for \(n\) large enough
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497489)