A285573 -id:A285573 - cp's OEIS frontend

A324837 Number of minimal subsets of {1...n} with least common multiple n.

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 2, 1, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 1, 3, 1, 8, 1, 1, 2, 2, 2, 5, 1, 2, 2, 4, 1, 8, 1, 3, 3, 2, 1, 5, 1, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 16, 1, 2, 3, 1, 2, 8, 1, 3, 2, 8, 1, 7, 1, 2, 3, 3, 2, 8, 1, 5, 1, 2, 1, 16, 2, 2

Offset: 1

Gus Wiseman, Mar 19 2019

nonn

Note that the elements must be pairwise indivisible divisors of n.

Differs from A303838 at positions {1, 180, 210, ...}. For example, a(210) = 49, A303838(210) = 55. - Gus Wiseman, Apr 01 2019

			The a(30) = 8 subsets are: {30}, {2,15}, {3,10}, {5,6}, {6,10}, {6,15}, {10,15}, {2,3,5}.

Gus Wiseman, Table of n, a(n) for n = 1..300

Cf. A000005, A006126, A074971, A076078, A085945, A285572, A285573, A286518, A286520, A303837, A303838, A324837.

minim[s_]:=Complement[s,First/@Select[Tuples[s,2],UnsameQ@@#&&SubsetQ@@#&]];
stableSets[u_,Q_]:=If[Length[u]==0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r==w||Q[r,w]||Q[w,r]],Q]]]];
Table[Length[minim[Select[Rest[stableSets[Divisors[n],Divisible]],LCM@@#==n&]]],{n,100}]

A328671 Numbers whose binary indices are relatively prime and pairwise indivisible.

Original entry on oeis.org

1, 6, 12, 18, 20, 22, 24, 28, 48, 56, 66, 68, 70, 72, 76, 80, 82, 84, 86, 88, 92, 96, 104, 112, 120, 132, 144, 148, 176, 192, 196, 208, 212, 224, 240, 258, 264, 272, 274, 280, 296, 304, 312, 320, 322, 328, 336, 338, 344, 352, 360, 368, 376, 384, 400, 416, 432

Offset: 1

Gus Wiseman, Oct 29 2019

nonn

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

			The sequence of terms together with their binary expansions and binary indices begins:
    1:         1 ~ {1}
    6:       110 ~ {2,3}
   12:      1100 ~ {3,4}
   18:     10010 ~ {2,5}
   20:     10100 ~ {3,5}
   22:     10110 ~ {2,3,5}
   24:     11000 ~ {4,5}
   28:     11100 ~ {3,4,5}
   48:    110000 ~ {5,6}
   56:    111000 ~ {4,5,6}
   66:   1000010 ~ {2,7}
   68:   1000100 ~ {3,7}
   70:   1000110 ~ {2,3,7}
   72:   1001000 ~ {4,7}
   76:   1001100 ~ {3,4,7}
   80:   1010000 ~ {5,7}
   82:   1010010 ~ {2,5,7}
   84:   1010100 ~ {3,5,7}
   86:   1010110 ~ {2,3,5,7}
   88:   1011000 ~ {4,5,7}

The version for prime indices (instead of binary indices) is A328677.
Numbers whose binary indices are relatively prime are A291166.
Numbers whose distinct prime indices are pairwise indivisible are A316476.
BII-numbers of antichains are A326704.
Relatively prime partitions whose distinct parts are pairwise indivisible are A328676, with strict case A328678.
Cf. A000120, A121016, A285573, A303362, A304713, A305148, A316468, A316475.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Select[Range[100],GCD@@bpe[#]==1&&stableQ[bpe[#],Divisible]&]

Intersection of A291166 with A326704.

A328672 Number of integer partitions of n with relatively prime parts in which no two distinct parts are relatively prime.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 4, 1, 4, 1, 1, 2, 7, 1, 6, 1, 3, 3, 10, 1, 9, 3, 5, 4, 17, 1, 23, 6, 7, 6, 20, 3, 36, 9, 15, 7, 45, 5, 56, 14, 17, 20, 65, 7, 83, 18, 40

Offset: 0

Gus Wiseman, Oct 29 2019

nonn

Positions of terms greater than 1 are {31, 37, 41, 43, 46, 47, 49, ...}.

A partition with no two distinct parts relatively prime is said to be intersecting.

			Examples:
  a(31) = 2:         a(46) = 2:
    (15,10,6)          (15,15,10,6)
    (1^31)             (1^46)
  a(37) = 3:         a(47) = 7:
    (15,12,10)         (20,15,12)
    (15,10,6,6)        (21,14,12)
    (1^37)             (20,15,6,6)
  a(41) = 4:           (21,14,6,6)
    (20,15,6)          (15,12,10,10)
    (21,14,6)          (15,10,10,6,6)
    (15,10,10,6)       (1^47)
    (1^41)           a(49) = 6:
  a(43) = 4:           (24,15,10)
    (18,15,10)         (18,15,10,6)
    (15,12,10,6)       (15,12,12,10)
    (15,10,6,6,6)      (15,12,10,6,6)
    (1^43)             (15,10,6,6,6,6)
                       (1^39)

Fausto A. C. Cariboni, Table of n, a(n) for n = 0..400

The Heinz numbers of these partitions are A328679.
The strict case is A318715.
The version for non-isomorphic multiset partitions is A319759.
Relatively prime partitions are A000837.
Intersecting partitions are A328673.
Cf. A078374, A285573, A289509, A291166, A303140, A305148, A316476, A326910, A326912.

Table[Length[Select[IntegerPartitions[n],GCD@@#==1&&And[And@@(GCD[##]>1&)@@@Subsets[Union[#],{2}]]&]],{n,0,32}]

a(n > 0) = A202425(n) + 1.

A322438 Number of unordered pairs of factorizations of n into factors > 1 where no factor of one properly divides any factor of the other.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 4

Offset: 1

Gus Wiseman, Dec 08 2018

nonn

First differs from A322437 at a(144) = 4, A322437(144) = 3.

First differs from A379958 at a(120) = 2, A379958(120) = 1.

			The a(240) = 5 pairs of factorizations::
  (4*4*15)|(4*6*10)
    (6*40)|(15*16)
    (8*30)|(12*20)
   (10*24)|(15*16)
   (12*20)|(15*16)

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences computed from exponents in factorization of n.

Cf. A001055, A285572, A285573, A303362, A303386, A304713, A305149, A305150, A305193, A316476, A317144, A322435, A322436, A322437, A322442, A379958.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
divpropQ[x_,y_]:=And[x!=y,Divisible[x,y]];
Table[Length[Select[Subsets[facs[n],{2}],And[!Or@@divpropQ@@@Tuples[#],!Or@@divpropQ@@@Reverse/@Tuples[#]]&]],{n,100}]

factorizations(n, m=n, f=List([]), z=List([])) = if(1==n, listput(z,Vec(f)); z, my(newf); fordiv(n, d, if((d>1)&&(d<=m), newf = List(f); listput(newf,d); z = factorizations(n/d, d, newf, z))); (z));
is_proper_ndf_pair(fac1,fac2) = { for(i=1,#fac1,for(j=1,#fac2,if((fac1[i]!=fac2[j]) && (!(fac1[i]%fac2[j]) || !(fac2[j]%fac1[i])),return(0)))); (1); };
number_of_proper_ndfpairs(z) = sum(i=1,#z,sum(j=i+1,#z,is_proper_ndf_pair(z[i],z[j])));
A322438(n) = number_of_proper_ndfpairs(Vec(factorizations(n))); \\ Antti Karttunen, Jan 24 2025

Data section extended up to a(144) by Antti Karttunen, Jan 24 2025

A317616 Numbers whose prime multiplicities are not pairwise indivisible.

Original entry on oeis.org

12, 18, 20, 24, 28, 40, 44, 45, 48, 50, 52, 54, 56, 60, 63, 68, 75, 76, 80, 84, 88, 90, 92, 96, 98, 99, 104, 112, 116, 117, 120, 124, 126, 132, 135, 136, 140, 144, 147, 148, 150, 152, 153, 156, 160, 162, 164, 168, 171, 172, 175, 176, 180, 184, 188, 189, 192

Offset: 1

Gus Wiseman, Aug 01 2018

nonn

The numbers of terms that do not exceed 10^k, for k = 2, 3, ..., are 26, 344, 3762, 38711, 390527, 3915874, 39192197, 392025578, 3920580540, ... . Apparently, the asymptotic density of this sequence exists and equals 0.392... . - Amiram Eldar, Sep 25 2024

			72 = 2^3 * 3^2 is not in the sequence because 3 and 2 are pairwise indivisible.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A118914, A124010, A285572, A285573, A303362, A304713, A316475, A317101, A317102.

Select[Range[100],!Select[Tuples[Last/@FactorInteger[#],2],And[UnsameQ@@#,Divisible@@#]&]=={}&]

is(k) = if(k == 1, 0, my(e = Set(factor(k)[,2])); if(vecmax(e) == 1, 0, for(i = 1, #e, for(j = 1, i-1, if(!(e[i] % e[j]), return(1)))); 0)); \\ Amiram Eldar, Sep 25 2024

A318730 Number of cyclic compositions (necklaces of positive integers) summing to n with adjacent parts (including the last and first part) being indivisible (either way).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 3, 2, 3, 6, 5, 8, 7, 14, 15, 21, 31, 39, 51, 69, 98, 133, 177, 254, 329, 471, 632, 902, 1230, 1710, 2370, 3270, 4591, 6384, 8898, 12429, 17252, 24230, 33783, 47405, 66254, 92860, 130142, 182469, 256262, 359676, 505231, 710059, 997953, 1404215

Offset: 1

Gus Wiseman, Sep 02 2018

nonn

			The a(14) = 14 cyclic compositions with adjacent parts indivisible either way:
  (14)
  (3,11) (4,10) (5,9) (6,8)
  (2,5,7) (2,7,5) (3,4,7) (3,7,4)
  (2,3,2,7) (2,3,4,5) (2,5,2,5) (2,5,4,3) (3,4,3,4)

Andrew Howroyd, Table of n, a(n) for n = 1..100

Cf. A000740, A008965, A059966, A167606, A285573, A303362, A304713, A316476, A318726, A318727, A318728, A318729, A328601.

neckQ[q_]:=Array[OrderedQ[{q,RotateRight[q,#]}]&,Length[q]-1,1,And];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],Or[Length[#]==1,And[neckQ[#],And@@Not/@Divisible@@@Partition[#,2,1,1],And@@Not/@Divisible@@@Reverse/@Partition[#,2,1,1]]]&]],{n,20}]

b(n, q, pred)={my(M=matrix(n, n)); for(k=1, n, M[k, k]=pred(q, k); for(i=1, k-1, M[i, k]=sum(j=1, k-i, if(pred(j, i), M[j, k-i], 0)))); M[q,]}
seq(n)={my(v=sum(k=1, n, k*b(n, k, (i,j)->i%j<>0 && j%i<>0))); vector(n, n, 1 + sumdiv(n, d, eulerphi(d)*v[n/d])/n)} \\ Andrew Howroyd, Oct 27 2019

a(n) = A328601(n) + 1. - Andrew Howroyd, Oct 27 2019

Terms a(21) and beyond from Andrew Howroyd, Sep 08 2018

A303364 Number of strict integer partitions of n with pairwise indivisible and squarefree parts.

Original entry on oeis.org

1, 1, 1, 0, 2, 1, 2, 1, 1, 3, 2, 2, 4, 3, 3, 4, 6, 5, 5, 6, 7, 8, 9, 10, 10, 11, 11, 14, 14, 17, 16, 18, 19, 23, 24, 27, 29, 30, 33, 36, 41, 41, 42, 46, 51, 56, 60, 66, 67, 71, 81, 86, 93, 96, 101, 110, 121, 129, 135, 144, 153, 159, 173, 192, 204, 207, 224

Offset: 1

Gus Wiseman, Apr 22 2018

nonn

			The a(23) = 9 strict integer partitions are (23), (13,10), (17,6), (21,2), (10,7,6), (11,7,5), (13,7,3), (11,7,3,2), (13,5,3,2).

Fausto A. C. Cariboni, Table of n, a(n) for n = 1..700 (terms 0..400 from Andrew Howroyd)

Cf. A000009, A000837, A003238, A005117, A006126, A051424, A073576, A285572, A285573, A293606, A293993, A303362, A303365.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&And@@SquareFreeQ/@#&&Select[Tuples[#,2],UnsameQ@@#&&Divisible@@#&]==={}&]],{n,60}]

lista(nn)={local(Cache=Map());
  my(excl=vector(nn, n, sumdiv(n, d, 2^(n-d))));
  my(c(n, m, b)=
     if(n==0, 1,
        while(m>n || bittest(b,0), m--; b>>=1);
        my(hk=[n, m, b], z);
        if(!mapisdefined(Cache, hk, &z),
          z = if(m, self()(n, m-1, b>>1) + self()(n-m, m, bitor(b, excl[m])), 0);
          mapput(Cache, hk, z)); z));
  my(a(n)=c(n, n, sum(i=1, n, if(!issquarefree(i), 2^(n-i)))));
  for(n=1, nn, print1(a(n), ", "))
} \\ Andrew Howroyd, Nov 02 2019

A305564 Number of finite sets of relatively prime positive integers with least common multiple n.

Original entry on oeis.org

1, 1, 1, 2, 1, 7, 1, 4, 2, 7, 1, 32, 1, 7, 7, 8, 1, 32, 1, 32, 7, 7, 1, 136, 2, 7, 4, 32, 1, 193, 1, 16, 7, 7, 7, 322, 1, 7, 7, 136, 1, 193, 1, 32, 32, 7, 1, 560, 2, 32, 7, 32, 1, 136, 7, 136, 7, 7, 1, 3464, 1, 7, 32, 32, 7, 193, 1, 32, 7, 193, 1, 2852, 1, 7

Offset: 1

Gus Wiseman, Jun 05 2018

nonn

			The a(6) = 7 sets are {1,6}, {2,3}, {1,2,3}, {1,2,6}, {1,3,6}, {2,3,6}, {1,2,3,6}.

Cf. A001055, A071625, A076078, A181819, A275870, A281116, A285573, A285572, A290103, A304818, A305563, A305565, A305566, A305567.

Table[Length[Select[Rest[Subsets[Divisors[n]]],And[GCD@@#==1,LCM@@#==n]&]],{n,100}]

A328676 Number of relatively prime integer partitions of n whose distinct parts are pairwise indivisible.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 4, 3, 5, 5, 11, 7, 16, 14, 18, 22, 34, 30, 47, 45, 59, 66, 89, 90, 118, 125, 159, 169, 218, 225, 289, 304, 369, 400, 486, 520, 636, 680, 806, 873, 1051, 1105, 1333, 1424, 1664, 1803, 2122, 2253, 2659, 2841, 3283, 3560, 4118, 4388, 5096

Offset: 1

Gus Wiseman, Oct 29 2019

nonn

			The a(4) = 1 through a(11) = 11 partitions:
  1111  32     111111  43       53        54         73          65
        11111          52       332       72         433         74
                       322      11111111  522        532         83
                       1111111            3222       3322        92
                                          111111111  1111111111  443
                                                                 533
                                                                 722
                                                                 3332
                                                                 5222
                                                                 32222
                                                                 11111111111

The Heinz numbers of these partitions are given by A328677.
The strict case is A328678.
The binary index version is A328671.
Relatively prime partitions are A000837.
Partitions whose distinct parts are pairwise indivisible are A305148.
Cf. A285573, A289509, A303362, A316476, A326912, A327393, A328171.

stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Table[Length[Select[IntegerPartitions[n],GCD@@#==1&&stableQ[#,Divisible]&]],{n,30}]

A096826 Number of maximal-sized antichains in divisor lattice D(n).

Original entry on oeis.org

1, 2, 2, 3, 2, 1, 2, 4, 3, 1, 2, 3, 2, 1, 1, 5, 2, 3, 2, 3, 1, 1, 2, 6, 3, 1, 4, 3, 2, 2, 2, 6, 1, 1, 1, 1, 2, 1, 1, 6, 2, 2, 2, 3, 3, 1, 2, 10, 3, 3, 1, 3, 2, 6, 1, 6, 1, 1, 2, 1, 2, 1, 3, 7, 1, 2, 2, 3, 1, 2, 2, 4, 2, 1, 3, 3, 1, 2, 2, 10, 5, 1, 2, 1, 1, 1

Offset: 1

Yuval Dekel (dekelyuval(AT)hotmail.com), Aug 17 2004

nonn

The divisor lattice D(n) is the lattice of the divisors of the natural number n.

			From _Gus Wiseman_, Aug 24 2018: (Start)
The a(120) = 6 antichains:
  {8,12,20,30}
  {8,12,15,20}
  {8,10,12,15}
  {6,8,15,20}
  {6,8,10,15}
  {4,6,10,15}
(End)

Eric M. Schmidt, Table of n, a(n) for n = 1..10000

Cf. A000005, A008480, A096825, A096827, A253249, A285572 A285573.

def A096826(n) :
    if n==1 : return 1
    R. = QQ[]; mults = [x[1] for x in factor(n)]
    maxsize = prod((t^(m+1)-1)//(t-1) for m in mults)[sum(mults)//2]
    dlat = LatticePoset((divisors(n), attrcall("divides")))
    count = 0
    for ac in dlat.antichains_iterator() :
        if len(ac) == maxsize : count += 1
    return count
# Eric M. Schmidt, May 13 2013

More terms from Eric M. Schmidt, May 13 2013

cp's OEIS Frontend

A324837 Number of minimal subsets of {1...n} with least common multiple n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A328671 Numbers whose binary indices are relatively prime and pairwise indivisible.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A328672 Number of integer partitions of n with relatively prime parts in which no two distinct parts are relatively prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A322438 Number of unordered pairs of factorizations of n into factors > 1 where no factor of one properly divides any factor of the other.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A317616 Numbers whose prime multiplicities are not pairwise indivisible.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A318730 Number of cyclic compositions (necklaces of positive integers) summing to n with adjacent parts (including the last and first part) being indivisible (either way).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A303364 Number of strict integer partitions of n with pairwise indivisible and squarefree parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A305564 Number of finite sets of relatively prime positive integers with least common multiple n.

Views

Author