OFFSET
0,6
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 0..10000
EXAMPLE
The a(3) = 1 through a(14) = 10 partitions (A = 10, B = 11, C = 12):
111 211 221 222 322 332 333 433 443 444 544 554
311 321 331 431 441 532 533 543 553 743
411 511 521 522 541 551 552 661 752
611 531 721 722 651 733 761
711 811 731 732 751 833
911 741 922 851
831 B11 941
921 A31
A11 B21
C11
MATHEMATICA
Table[Length[Select[IntegerPartitions[n, {3}], SameQ@@#||CoprimeQ@@Union[#]&]], {n, 0, 100}]
CROSSREFS
A220377 is the strict case.
A304712 counts these partitions of any length.
A307719 is the strict case except for any number of 1's.
A337601 does not consider a singleton to be coprime unless it is (1).
A337602 is the ordered version.
A337664 counts compositions of this type and any length.
A000217 counts 3-part compositions.
A000837 counts relatively prime partitions.
A023023 counts relatively prime 3-part partitions.
A051424 counts pairwise coprime or singleton partitions.
A101268 counts pairwise coprime or singleton compositions.
A304709 counts partitions whose distinct parts are pairwise coprime.
A305713 counts pairwise coprime strict partitions.
A327516 counts pairwise coprime partitions.
A333227 ranks pairwise coprime compositions.
A333228 ranks compositions whose distinct parts are pairwise coprime.
A337461 counts pairwise coprime length-3 compositions.
A337563 counts pairwise coprime length-3 partitions with no 1's.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 20 2020
STATUS
approved