A343346 -id:A343346 - cp's OEIS frontend

A343345 Number of integer partitions of n that are empty, or have smallest part dividing all the others, but do not have greatest part divisible by all the others.

1, 0, 0, 0, 0, 0, 1, 1, 4, 6, 11, 16, 29, 36, 59, 79, 115, 149, 216, 270, 379, 473, 634, 793, 1063, 1292, 1689, 2079, 2667, 3241, 4142, 4982, 6291, 7582, 9434, 11321, 14049, 16709, 20545, 24490, 29860, 35380, 43004, 50741, 61282, 72284, 86680, 101906, 121990

Offset: 0

Gus Wiseman, Apr 15 2021

nonn

First differs from A343346 at a(14) = 79, A343346(14) = 80.

Alternative name: Number of integer partitions of n with a part dividing all the others, but with no part divisible by all the others.

			The a(6) = 1 through a(11) = 16 partitions:
  (321)  (3211)  (431)    (531)     (541)      (641)
                 (521)    (3321)    (721)      (731)
                 (3221)   (4311)    (4321)     (4331)
                 (32111)  (5211)    (5221)     (5321)
                          (32211)   (5311)     (5411)
                          (321111)  (32221)    (7211)
                                    (33211)    (33221)
                                    (43111)    (43211)
                                    (52111)    (52211)
                                    (322111)   (53111)
                                    (3211111)  (322211)
                                               (332111)
                                               (431111)
                                               (521111)
                                               (3221111)
                                               (32111111)

The first condition alone gives A083710.
The half-opposite versions are A130714 and A343342.
The Heinz numbers of these partitions are 1 and A343340.
The second condition alone gives A343341.
The opposite version is A343344.
The strict case is A343381.
A000009 counts strict partitions.
A000041 counts partitions.
A000070 counts partitions with a selected part.
A006128 counts partitions with a selected position.
A015723 counts strict partitions with a selected part.
A018818 counts partitions into divisors (strict: A033630).
Cf. A083711, A097986, A098743, A098965, A130689, A264401, A339563, A343337.

Table[Length[Select[IntegerPartitions[n],#=={}||And@@IntegerQ/@(#/Min@@#)&&!And@@IntegerQ/@(Max@@#/#)&]],{n,0,30}]

A343344 Number of integer partitions of n that are either empty, or do not have smallest part dividing all the others, but do have greatest part divisible by all the others.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 5, 1, 6, 4, 6, 7, 15, 6, 16, 15, 20, 17, 36, 18, 43, 36, 46, 48, 72, 45, 93, 82, 103, 88, 152, 104, 179, 158, 191, 194, 285, 202, 328, 292, 373, 348, 502, 391, 576, 519, 659, 634, 864, 665

Offset: 0

Gus Wiseman, Apr 15 2021

nonn

Alternative name: Number of integer partitions of n with no part dividing all the others, but with a part divisible by all the others.

			The a(18) = 1  through a(23) = 15 partitions (A..E = 10..14):
  633222   C43       C332      C432       C64        E72
           A522      66332     A5222      A552       F53
           C322      633332    C3222      C433       I32
           66322     6332222   663222     C3322      C443
           633322              6333222    663322     C632
           6322222             63222222   6333322    66632
                                          63322222   C3332
                                                     C4322
                                                     663332
                                                     A52222
                                                     C32222
                                                     6333332
                                                     6632222
                                                     63332222
                                                     632222222

The second condition alone gives A130689.
The half-opposite versions are A130714 and A343342.
The first condition alone gives A338470.
The Heinz numbers of these partitions are 1 and A343339.
The opposite version is A343345.
The strict case is A343380.
A000009 counts strict partitions.
A000041 counts partitions.
A000070 counts partitions with a selected part.
A006128 counts partitions with a selected position.
A015723 counts strict partitions with a selected part.
Cf. A083710, A097986, A264401, A339562, A341450, A342193, A343346.

Table[Length[Select[IntegerPartitions[n],#=={}||!And@@IntegerQ/@(#/Min@@#)&&And@@IntegerQ/@(Max@@#/#)&]],{n,0,30}]

A339619 Number of integer partitions of n with no 1's and a part divisible by all the other parts.

Original entry on oeis.org

1, 0, 1, 1, 2, 1, 4, 1, 5, 3, 7, 2, 13, 2, 13, 9, 17, 6, 27, 7, 33, 19, 35, 16, 58, 22, 58, 39, 75, 37, 108, 44, 117, 75, 132, 88, 190, 94, 199, 147, 250, 153, 322, 180, 363, 271, 405, 286, 544, 339, 601, 458, 699, 503, 868, 608, 990, 777, 1113, 865, 1422, 993

Offset: 0

Gus Wiseman, Apr 18 2021

nonn

Alternative name: Number of integer partitions of n with no 1's that are empty or have greatest part divisible by all the other parts.

			The a(6) = 4 through a(16) = 17 partitions (A..G = 10..16):
  6    7  8     9    A      B    C       D     E        F      G
  33      44    63   55     632  66      6322  77       A5     88
  42      62    333  82          84            C2       C3     C4
  222     422        442         93            662      555    E2
          2222       622         A2            842      663    844
                     4222        444           A22      933    C22
                     22222       633           4442     6333   4444
                                 822           6332     33333  6622
                                 3333          8222     63222  8422
                                 4422          44222           A222
                                 6222          62222           44422
                                 42222         422222          63322
                                 222222        2222222         82222
                                                               442222
                                                               622222
                                                               4222222
                                                               22222222

The dual version is A083711.
The version with 1's allowed is A130689.
The strict case is A339660.
The Heinz numbers of these partitions are the odd complement of A343337.
The strict case with 1's allowed is A343347.
A000009 counts strict partitions.
A000041 counts partitions.
A000070 counts partitions with a selected part.
A006128 counts partitions with a selected position.
A015723 counts strict partitions with a selected part.
Cf. A066186, A083710, A083711, A097986, A130714, A338470, A343341, A343342, A343346, A343377, A343382.

Table[If[n==0,1,Length[Select[IntegerPartitions[n],FreeQ[#,1]&&Or@@And@@IntegerQ/@(Max@@#/#)&]]],{n,0,30}]

A343343 Numbers with either no prime index dividing, or no prime index divisible by all the other prime indices.

Original entry on oeis.org

1, 15, 30, 33, 35, 45, 51, 55, 60, 66, 69, 70, 75, 77, 85, 90, 91, 93, 95, 99, 102, 105, 110, 119, 120, 123, 132, 135, 138, 140, 141, 143, 145, 150, 153, 154, 155, 161, 165, 170, 175, 177, 180, 182, 186, 187, 190, 195, 198, 201, 203, 204, 205, 207, 209, 210

Offset: 1

Gus Wiseman, Apr 15 2021

nonn

After 1, first differs from A318992 in lacking 390, with prime indices {1,2,3,6}.
First differs from A343337 in having 195, with prime indices {2,3,6}.
Alternative name: 1 and numbers where either the smallest prime index is not a divisor of all the other prime indices, or the greatest prime index is not divisible by all the other prime indices.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
Also Heinz numbers of partitions that either empty, have smallest part not dividing all the others, or have greatest part not divisible by all the others (counted by A343346). The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions.

			The sequence of terms together with their prime indices begins:
      1: {}            90: {1,2,2,3}      141: {2,15}
     15: {2,3}         91: {4,6}          143: {5,6}
     30: {1,2,3}       93: {2,11}         145: {3,10}
     33: {2,5}         95: {3,8}          150: {1,2,3,3}
     35: {3,4}         99: {2,2,5}        153: {2,2,7}
     45: {2,2,3}      102: {1,2,7}        154: {1,4,5}
     51: {2,7}        105: {2,3,4}        155: {3,11}
     55: {3,5}        110: {1,3,5}        161: {4,9}
     60: {1,1,2,3}    119: {4,7}          165: {2,3,5}
     66: {1,2,5}      120: {1,1,1,2,3}    170: {1,3,7}
     69: {2,9}        123: {2,13}         175: {3,3,4}
     70: {1,3,4}      132: {1,1,2,5}      177: {2,17}
     75: {2,3,3}      135: {2,2,2,3}      180: {1,1,2,2,3}
     77: {4,5}        138: {1,2,9}        182: {1,4,6}
     85: {3,7}        140: {1,1,3,4}      186: {1,2,11}
For example, the prime indices of 90 are {1,2,2,3}, and, because 1 divides all the other parts, 90 is in the sequence, even though 3 is not divisible by all the other parts.

The partitions without these Heinz numbers are counted by A130714.
The first condition alone gives A342193.
The second condition alone gives A343337.
The "and" instead of "or" version is A343338.
The partitions with these Heinz numbers are counted by A343346.
A000005 counts divisors.
A000070 counts partitions with a selected part.
A006128 counts partitions with a selected position.
A015723 counts strict partitions with a selected part.
A018818 counts partitions into divisors (strict: A033630).
A056239 adds up prime indices, row sums of A112798.
A067824 counts strict chains of divisors starting with n.
A253249 counts strict chains of divisors.
A339564 counts factorizations with a selected factor.
Cf. A083710, A257993, A338470, A339562, A341450, A343339, A343340, A343341, A343342, A343378, A343379, A343382.

Select[Range[100],#==1||With[{p=PrimePi/@First/@FactorInteger[#]},!And@@IntegerQ/@(Max@@p/p)||!And@@IntegerQ/@(p/Min@@p)]&]

Equals the union of A342193 and A343337.

cp's OEIS Frontend

A343345 Number of integer partitions of n that are empty, or have smallest part dividing all the others, but do not have greatest part divisible by all the others.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A343344 Number of integer partitions of n that are either empty, or do not have smallest part dividing all the others, but do have greatest part divisible by all the others.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A339619 Number of integer partitions of n with no 1's and a part divisible by all the other parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A343343 Numbers with either no prime index dividing, or no prime index divisible by all the other prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula