OFFSET
0,5
COMMENTS
A partition is relatively prime if the GCD of its parts is 1. Zeros are ignored when computing GCD, and the empty set has GCD 0.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..1000
FORMULA
G.f.: Sum_{d>=1} mu(d)*(-1/(1-x) + 1/(Prod_{k>=0} 1 - x^(k*d + 1))). - Andrew Howroyd, Oct 17 2019
EXAMPLE
The a(2) = 1 through a(9) = 18 partitions:
(2) (21) (22) (32) (42) (43) (62) (54)
(211) (221) (222) (52) (332) (63)
(2111) (321) (322) (422) (72)
(2211) (421) (431) (432)
(21111) (2221) (521) (522)
(3211) (2222) (621)
(22111) (3221) (3222)
(211111) (4211) (3321)
(22211) (4221)
(32111) (4311)
(221111) (5211)
(2111111) (22221)
(32211)
(42111)
(222111)
(321111)
(2211111)
(21111111)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], GCD@@(#-1)==1&]], {n, 0, 30}]
PROG
(PARI) seq(n)=Vec(sum(d=1, n-1, moebius(d)*(-1/(1-x) + 1/prod(k=0, n\d, 1 - x*x^(k*d) + O(x*x^n)))), -(n+1)) \\ Andrew Howroyd, Oct 17 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 09 2019
STATUS
approved