The partitions of an integer N are all the combinations of integers smaller than or equal to N and higher than 0 which sum up to N.
A relatively prime partition is an integer partition, but whose elements are (overall) coprime; or in other words, there is no integer greater than 1 which divides all of the parts.
Given an integer as input, your task is to output the count of relatively prime partitions it has. Rather not surprised that there is an OEIS sequence for this. The aim is to shorten your code as much as possible, with usual code golf rules.
Also, you don't have to worry about memory errors. Your algorithm must only theoretically work for an arbitrarily big values of N, but it is fine if your language has certain limitations. You can assume that N will always be at least 1.
Test cases and Example
5 as an example. Its integer partitions are:
1 1 1 1 1 1 1 1 2 1 1 3 1 2 2 1 4 2 3 5
From this, the first 6 only are relatively prime partitions. Note that the last one (formed by the integer in question only) must not be taken into account as a relatively prime partition (except for N=1) because its GCD is N.
N -> Output 1 -> 1 2 -> 1 3 -> 2 4 -> 3 5 -> 6 6 -> 7 7 -> 14 8 -> 17 9 -> 27 10 -> 34