Copyright © 1990 Published by Elsevier Science B.V. All rights reserved.
Partitions whose parts are pairwise relatively prime
Received 3 August 1987.
Available online 25 March 2002.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Let an be the number of (unordered) partitions of n into parts that are “pairwise” relatively prime. In other words, count λ = {λ1, λ2,…} if and only if gcd(λi, j) = 1 for all i ≠ j. We show that log







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)

{0}. Let 


