OFFSET
0,6
COMMENTS
A strict composition of n is a finite sequence of distinct positive integers summing to n.
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 0..350
EXAMPLE
The a(5) = 2 through a(10) = 8 compositions (empty column indicated by dot):
(2,3) . (2,5) (3,5) (2,7) (3,7)
(3,2) (3,4) (5,3) (4,5) (7,3)
(4,3) (5,4) (2,3,5)
(5,2) (7,2) (2,5,3)
(2,3,4) (3,2,5)
(2,4,3) (3,5,2)
(3,2,4) (5,2,3)
(3,4,2) (5,3,2)
(4,2,3)
(4,3,2)
MATHEMATICA
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], UnsameQ@@#&&!MemberQ[#, 1]&&GCD@@#==1&]], {n, 0, 15}]
CROSSREFS
A032022 does not require relative primality.
A302698 is the unordered non-strict version.
A332004 is the version allowing 1's.
A337450 is the non-strict version.
A337452 is the unordered version.
A000837 counts relatively prime partitions.
A032020 counts strict compositions.
A078374 counts strict relatively prime partitions.
A002865 counts partitions with no 1's.
A212804 counts compositions with no 1's.
A291166 appears to rank relatively prime compositions.
A337462 counts pairwise coprime compositions.
A337561 counts strict pairwise coprime compositions.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Aug 31 2020
STATUS
approved