A325683 -id:A325683 - cp's OEIS frontend

A343660 Number of maximal pairwise coprime sets of at least two divisors > 1 of n.

0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 1, 0, 0, 2, 0, 2, 1, 1, 0, 3, 0, 1, 0, 2, 0, 4, 0, 0, 1, 1, 1, 4, 0, 1, 1, 3, 0, 4, 0, 2, 2, 1, 0, 4, 0, 2, 1, 2, 0, 3, 1, 3, 1, 1, 0, 8, 0, 1, 2, 0, 1, 4, 0, 2, 1, 4, 0, 6, 0, 1, 2, 2, 1, 4, 0, 4, 0, 1, 0, 8, 1, 1, 1

Offset: 1

Gus Wiseman, Apr 26 2021

nonn

			The a(n) sets for n = 6, 12, 24, 30, 36, 60, 72, 96:
  {2,3}  {2,3}  {2,3}  {5,6}    {2,3}  {5,6}    {2,3}  {2,3}
         {3,4}  {3,4}  {2,15}   {2,9}  {2,15}   {2,9}  {3,4}
                {3,8}  {3,10}   {3,4}  {3,10}   {3,4}  {3,8}
                       {2,3,5}  {4,9}  {3,20}   {3,8}  {3,16}
                                       {4,15}   {4,9}  {3,32}
                                       {5,12}   {8,9}
                                       {2,3,5}
                                       {3,4,5}

The case of pairs is A089233.
The case with 1's is A343652.
The case with singletons is (also) A343652.
The non-maximal version is A343653.
The non-maximal version with 1's is A343655.
The version for subsets of {2..n} is A343659 (for n > 2).
A018892 counts coprime unordered pairs of divisors.
A051026 counts pairwise indivisible subsets of {1..n}.
A066620 counts pairwise coprime 3-sets of divisors.
A100565 counts pairwise coprime unordered triples of divisors.
Cf. A005361, A007359, A007360, A067824, A074206, A225520, A276187, A320426, A325683, A326077, A326359, A326496, A337485, A343654.

fasmax[y_]:=Complement[y,Union@@Most@*Subsets/@y];
Table[Length[fasmax[Select[Subsets[Rest[Divisors[n]]],CoprimeQ@@#&]]],{n,100}]

a(n) = A343652(n) - A005361(n).

A308251 Number of subsets of {1,...,n + 1} containing n + 1 and such that all positive differences of distinct elements are distinct.

Original entry on oeis.org

1, 2, 3, 6, 9, 14, 21, 34, 49, 76, 101, 146, 205, 294, 397, 560, 747, 1028, 1341, 1810, 2343, 3178, 4051, 5370, 6921, 9014, 11361, 14838, 18719, 24082, 29953, 38220, 47663, 60550, 74619, 93848, 115961, 145320, 177549, 221676, 270335, 335124

Offset: 0

Gus Wiseman, May 17 2019

nonn

Also the number of subsets of {1...n} containing no positive differences of the elements and such that all such differences are distinct.

			The a(0) = 1 through a(5) = 14 subsets:
  {1}  {2}    {3}    {4}      {5}      {6}
       {1,2}  {1,3}  {1,4}    {1,5}    {1,6}
              {2,3}  {2,4}    {2,5}    {2,6}
                     {3,4}    {3,5}    {3,6}
                     {1,2,4}  {4,5}    {4,6}
                     {1,3,4}  {1,2,5}  {5,6}
                              {1,4,5}  {1,2,6}
                              {2,3,5}  {1,3,6}
                              {2,4,5}  {1,4,6}
                                       {1,5,6}
                                       {2,3,6}
                                       {2,5,6}
                                       {3,4,6}
                                       {3,5,6}

Fausto A. C. Cariboni, Table of n, a(n) for n = 0..99 (terms 0..41 from Gus Wiseman, terms 42..80 from Vaclav Kotesovec)

Cf. A000079, A108917, A143823, A143824, A169942, A325676, A325677, A325683, A325687.

Table[Length[Select[Subsets[Range[n]],MemberQ[#,n]&&UnsameQ@@Abs[Subtract@@@Subsets[#,{2}]]&]],{n,15}]

First differences of A143823. Partial sums of A169942.

A325777 Heinz numbers of integer partitions whose distinct consecutive subsequences do not have different sums.

Original entry on oeis.org

12, 24, 30, 36, 40, 48, 60, 63, 70, 72, 80, 84, 90, 96, 108, 112, 120, 126, 132, 140, 144, 150, 154, 156, 160, 165, 168, 180, 189, 192, 198, 200, 204, 210, 216, 220, 224, 228, 240, 252, 264, 270, 273, 276, 280, 286, 288, 300, 308, 312, 315, 320, 324, 325, 330

Offset: 1

Gus Wiseman, May 20 2019

nonn

First differs from A299729 in lacking 462.

This sequence does not contain all multiples of its elements. For example, it contains 154 (with prime indices {1,4,5}) but not 462 (with prime indices {1,2,4,5}).

Complement of A325778.

Cf. A002033, A056239, A112798, A143823, A169942, A299702, A301899, A325676, A325683, A325768, A325769, A325770.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],!UnsameQ@@Total/@Union[ReplaceList[primeMS[#],{_,s__,_}:>{s}]]&]

cp's OEIS Frontend

A343660 Number of maximal pairwise coprime sets of at least two divisors > 1 of n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A308251 Number of subsets of {1,...,n + 1} containing n + 1 and such that all positive differences of distinct elements are distinct.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A325777 Heinz numbers of integer partitions whose distinct consecutive subsequences do not have different sums.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica