OFFSET
0,4
COMMENTS
A composition of n is a finite sequence of positive integers summing to n.
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 0..500
FORMULA
For n > 1, a(n) = A101268(n) - 1.
EXAMPLE
The a(1) = 1 through a(5) = 12 compositions:
(1) (1,1) (1,2) (1,3) (1,4)
(2,1) (3,1) (2,3)
(1,1,1) (1,1,2) (3,2)
(1,2,1) (4,1)
(2,1,1) (1,1,3)
(1,1,1,1) (1,3,1)
(3,1,1)
(1,1,1,2)
(1,1,2,1)
(1,2,1,1)
(2,1,1,1)
(1,1,1,1,1)
MATHEMATICA
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], #=={}||CoprimeQ@@#&]], {n, 0, 10}]
CROSSREFS
A000740 counts the relatively prime instead of pairwise coprime version.
A327516 is the unordered version.
A337461 counts these compositions of length 3.
A337561 is the strict case.
A051424 counts pairwise coprime or singleton partitions.
A101268 counts pairwise coprime or singleton compositions.
A178472 counts compositions with a common factor.
A305713 counts strict pairwise coprime partitions.
A328673 counts pairwise non-coprime partitions.
A333228 ranks compositions whose distinct parts are pairwise coprime.
A337667 counts pairwise non-coprime compositions.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 18 2020
STATUS
approved