A340387 -id:A340387 - cp's OEIS frontend

A340602 Heinz numbers of integer partitions of even rank.

1, 2, 5, 6, 8, 9, 11, 14, 17, 20, 21, 23, 24, 26, 30, 31, 32, 35, 36, 38, 39, 41, 44, 45, 47, 49, 50, 54, 56, 57, 58, 59, 65, 66, 67, 68, 73, 74, 75, 80, 81, 83, 84, 86, 87, 91, 92, 95, 96, 97, 99, 102, 103, 104, 106, 109, 110, 111, 120, 122, 124, 125, 126, 127

Offset: 1

Gus Wiseman, Jan 21 2021

nonn

The Dyson rank of a nonempty partition is its maximum part minus its length. The rank of an empty partition is 0.

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

			The sequence of partitions with their Heinz numbers begins:
     1: ()           31: (11)           58: (10,1)
     2: (1)          32: (1,1,1,1,1)    59: (17)
     5: (3)          35: (4,3)          65: (6,3)
     6: (2,1)        36: (2,2,1,1)      66: (5,2,1)
     8: (1,1,1)      38: (8,1)          67: (19)
     9: (2,2)        39: (6,2)          68: (7,1,1)
    11: (5)          41: (13)           73: (21)
    14: (4,1)        44: (5,1,1)        74: (12,1)
    17: (7)          45: (3,2,2)        75: (3,3,2)
    20: (3,1,1)      47: (15)           80: (3,1,1,1,1)
    21: (4,2)        49: (4,4)          81: (2,2,2,2)
    23: (9)          50: (3,3,1)        83: (23)
    24: (2,1,1,1)    54: (2,2,2,1)      84: (4,2,1,1)
    26: (6,1)        56: (4,1,1,1)      86: (14,1)
    30: (3,2,1)      57: (8,2)          87: (10,2)

FindStat, St000145: The Dyson rank of a partition

Taking only length gives A001222.
Taking only maximum part gives A061395.
These partitions are counted by A340601.
The complement is A340603.
The case of positive rank is A340605.
- Rank -
A047993 counts partitions of rank 0 (A106529).
A101198 counts partitions of rank 1 (A325233).
A101707 counts partitions of odd positive rank (A340604).
A101708 counts partitions of even positive rank (A340605).
A257541 gives the rank of the partition with Heinz number n.
A324516 counts partitions with rank = maximum minus minimum part (A324515).
A340653 counts factorizations of rank 0.
A340692 counts partitions of odd rank (A340603).
- Even -
A024430 counts set partitions of even length.
A027187 counts partitions of even length (A028260).
A027187 (also) counts partitions of even maximum (A244990).
A034008 counts compositions of even length.
A035363 counts partitions into even parts (A066207).
A052841 counts ordered set partitions of even length.
A058696 counts partitions of even numbers (A300061).
A067661 counts strict partitions of even length (A030229).
A236913 counts even-length partitions of even numbers (A340784).
A339846 counts factorizations of even length.
Cf. A000041, A006141, A056239, A072233, A112798, A168659, A325134, A326836, A326845, A340386, A340387.

Select[Range[100],EvenQ[PrimePi[FactorInteger[#][[-1,1]]]-PrimeOmega[#]]&]

Either n = 1 or A061395(n) - A001222(n) is even.

A344291 Numbers whose sum of prime indices is at least twice their number of prime indices (counted with multiplicity).

Original entry on oeis.org

1, 3, 5, 7, 9, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 57, 58, 59, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 81, 82, 83, 84, 85

Offset: 1

Gus Wiseman, May 15 2021

nonn

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.

			The sequence of terms together with their prime indices begins:
     1: {}       25: {3,3}      43: {14}       62: {1,11}
     3: {2}      26: {1,6}      44: {1,1,5}    63: {2,2,4}
     5: {3}      27: {2,2,2}    45: {2,2,3}    65: {3,6}
     7: {4}      28: {1,1,4}    46: {1,9}      66: {1,2,5}
     9: {2,2}    29: {10}       47: {15}       67: {19}
    10: {1,3}    30: {1,2,3}    49: {4,4}      68: {1,1,7}
    11: {5}      31: {11}       50: {1,3,3}    69: {2,9}
    13: {6}      33: {2,5}      51: {2,7}      70: {1,3,4}
    14: {1,4}    34: {1,7}      52: {1,1,6}    71: {20}
    15: {2,3}    35: {3,4}      53: {16}       73: {21}
    17: {7}      37: {12}       55: {3,5}      74: {1,12}
    19: {8}      38: {1,8}      57: {2,8}      75: {2,3,3}
    21: {2,4}    39: {2,6}      58: {1,10}     76: {1,1,8}
    22: {1,5}    41: {13}       59: {17}       77: {4,5}
    23: {9}      42: {1,2,4}    61: {18}       78: {1,2,6}
For example, the prime indices of 45 are {2,2,3} with sum 7 >= 2*3, so 45 is in the sequence.

The partitions with these Heinz numbers are counted by A110618.
The conjugate version is A322109.
The case of equality is A340387, counted by A035363.
The 5-smooth case is A344293, with non-3-smooth case A344294.
The opposite version is A344296.
The conjugate opposite version is A344414.
The conjugate case of equality is A344415.
A001221 counts distinct prime indices.
A001222 counts prime indices with multiplicity.
A056239 adds up prime indices, row sums of A112798.
Cf. A001358, A025065, A084127, A244990, A344292.

Select[Range[100],PrimeOmega[#]<=Total[Cases[FactorInteger[#],{p_,k_}:>k*PrimePi[p]]]/2&]

A056239(a(n)) >= 2*A001222(a(n)).

A344414 Heinz numbers of integer partitions whose sum is at most twice their greatest part.

Original entry on oeis.org

2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 49, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 76, 77, 78, 79, 82, 83, 84, 85

Offset: 1

Gus Wiseman, May 19 2021

nonn

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:
     2: {1}        20: {1,1,3}    39: {2,6}
     3: {2}        21: {2,4}      40: {1,1,1,3}
     4: {1,1}      22: {1,5}      41: {13}
     5: {3}        23: {9}        42: {1,2,4}
     6: {1,2}      25: {3,3}      43: {14}
     7: {4}        26: {1,6}      44: {1,1,5}
     9: {2,2}      28: {1,1,4}    46: {1,9}
    10: {1,3}      29: {10}       47: {15}
    11: {5}        30: {1,2,3}    49: {4,4}
    12: {1,1,2}    31: {11}       51: {2,7}
    13: {6}        33: {2,5}      52: {1,1,6}
    14: {1,4}      34: {1,7}      53: {16}
    15: {2,3}      35: {3,4}      55: {3,5}
    17: {7}        37: {12}       56: {1,1,1,4}
    19: {8}        38: {1,8}      57: {2,8}
For example, 56 has prime indices {1,1,1,4} and 7 <= 2*4, so 56 is in the sequence. On the other hand, 224 has prime indices {1,1,1,1,1,4} and 9 > 2*4, so 224 is not in the sequence.

These partitions are counted by A025065 but are different from palindromic partitions, which have Heinz numbers A265640.
The opposite even-weight version appears to be A320924, counted by A209816.
The opposite version appears to be A322109, counted by A110618.
The case of equality in the conjugate version is A340387.
The conjugate opposite version is A344291, counted by A110618.
The conjugate opposite 5-smooth case is A344293, counted by A266755.
The conjugate version is A344296, also counted by A025065.
The case of equality is A344415.
The even-weight case is A344416.
A001222 counts prime factors with multiplicity.
A027187 counts partitions of even length, ranked by A028260.
A056239 adds up prime indices, row sums of A112798.
A058696 counts partitions of even numbers, ranked by A300061.
A301987 lists numbers whose sum of prime indices equals their product.
A334201 adds up all prime indices except the greatest.
Cf. A001414, A067538, A301988, A316413, A316428, A325037, A325038, A325044, A330950, A344294, A344297.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Max[primeMS[#]]>=Total[primeMS[#]]/2&]

A056239(a(n)) <= 2*A061395(a(n)).

A340605 Heinz numbers of integer partitions of even positive rank.

Original entry on oeis.org

5, 11, 14, 17, 21, 23, 26, 31, 35, 38, 39, 41, 44, 47, 49, 57, 58, 59, 65, 66, 67, 68, 73, 74, 83, 86, 87, 91, 92, 95, 97, 99, 102, 103, 104, 106, 109, 110, 111, 122, 124, 127, 129, 133, 137, 138, 142, 143, 145, 149, 152, 153, 154, 156, 157, 158, 159, 164, 165

Offset: 1

Gus Wiseman, Jan 21 2021

nonn

The Dyson rank of a nonempty partition is its maximum part minus its number of parts. The rank of an empty partition is 0.

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

			The sequence of partitions with their Heinz numbers begins:
      5: (3)         57: (8,2)       97: (25)
     11: (5)         58: (10,1)      99: (5,2,2)
     14: (4,1)       59: (17)       102: (7,2,1)
     17: (7)         65: (6,3)      103: (27)
     21: (4,2)       66: (5,2,1)    104: (6,1,1,1)
     23: (9)         67: (19)       106: (16,1)
     26: (6,1)       68: (7,1,1)    109: (29)
     31: (11)        73: (21)       110: (5,3,1)
     35: (4,3)       74: (12,1)     111: (12,2)
     38: (8,1)       83: (23)       122: (18,1)
     39: (6,2)       86: (14,1)     124: (11,1,1)
     41: (13)        87: (10,2)     127: (31)
     44: (5,1,1)     91: (6,4)      129: (14,2)
     47: (15)        92: (9,1,1)    133: (8,4)
     49: (4,4)       95: (8,3)      137: (33)

FindStat, St000145: The Dyson rank of a partition

Note: Heinz numbers are given in parentheses below.
Allowing any positive rank gives A064173 (A340787).
The odd version is counted by A101707 (A340604).
These partitions are counted by A101708.
The not necessarily positive case is counted by A340601 (A340602).
A001222 counts prime indices.
A061395 gives maximum prime index.
A072233 counts partitions by sum and length.
- Rank -
A047993 counts partitions of rank 0 (A106529).
A064173 counts partitions of negative rank (A340788).
A064174 counts partitions of nonnegative rank (A324562).
A064174 (also) counts partitions of nonpositive rank (A324521).
A101198 counts partitions of rank 1 (A325233).
A257541 gives the rank of the partition with Heinz number n.
A340692 counts partitions of odd rank (A340603).
- Even -
A027187 counts partitions of even length (A028260).
A027187 (also) counts partitions of even maximum (A244990).
A035363 counts partitions into even parts (A066207).
A058696 counts partitions of even numbers (A300061).
A067661 counts strict partitions of even length (A030229).
A339846 counts factorizations of even length.
Cf. A006141, A024430, A056239, A112798, A340387, A340598, A340600, A340608, A340609, A340610, A340653.

rk[n_]:=PrimePi[FactorInteger[n][[-1,1]]]-PrimeOmega[n];
Select[Range[100],EvenQ[rk[#]]&&rk[#]>0&]

A061395(a(n)) - A001222(a(n)) is even and positive.

A340604 \/ A340605 = A340787.

A340931 Heinz numbers of integer partitions of odd numbers into an odd number of parts.

Original entry on oeis.org

2, 5, 8, 11, 17, 18, 20, 23, 31, 32, 41, 42, 44, 45, 47, 50, 59, 67, 68, 72, 73, 78, 80, 83, 92, 97, 98, 99, 103, 105, 109, 110, 114, 124, 125, 127, 128, 137, 149, 153, 157, 162, 164, 167, 168, 170, 174, 176, 179, 180, 182, 188, 191, 195, 197, 200, 207, 211

Offset: 1

Gus Wiseman, Feb 05 2021

nonn

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This is a bijective correspondence between positive integers and integer partitions.

			The sequence of terms together with the corresponding partitions begins:
      2: (1)             50: (3,3,1)        109: (29)
      5: (3)             59: (17)           110: (5,3,1)
      8: (1,1,1)         67: (19)           114: (8,2,1)
     11: (5)             68: (7,1,1)        124: (11,1,1)
     17: (7)             72: (2,2,1,1,1)    125: (3,3,3)
     18: (2,2,1)         73: (21)           127: (31)
     20: (3,1,1)         78: (6,2,1)        128: (1,1,1,1,1,1,1)
     23: (9)             80: (3,1,1,1,1)    137: (33)
     31: (11)            83: (23)           149: (35)
     32: (1,1,1,1,1)     92: (9,1,1)        153: (7,2,2)
     41: (13)            97: (25)           157: (37)
     42: (4,2,1)         98: (4,4,1)        162: (2,2,2,2,1)
     44: (5,1,1)         99: (5,2,2)        164: (13,1,1)
     45: (3,2,2)        103: (27)           167: (39)
     47: (15)           105: (4,3,2)        168: (4,2,1,1,1)

Note: A-numbers of Heinz-number sequences are in parentheses below.
These partitions are counted by A160786.
The even version is A236913 (A340784).
The case of where the prime indices are also odd is A300272.
A000009 counts partitions into odd parts (A066208).
A001222 counts prime factors.
A027193 counts odd-length partitions (A026424).
A047993 counts balanced partitions (A106529).
A056239 adds up prime indices.
A058695 counts partitions of odd numbers (A300063).
A072233 counts partitions by sum and length.
A112798 lists the prime indices of each positive integer.
Cf. A000041, A316413, A326845, A340385, A340386, A340387, A340604, A340607, A340854, A340855.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],OddQ[PrimeOmega[#]]&&OddQ[Total[primeMS[#]]]&]

Intersection of A026424 and A300063.

A344293 5-smooth numbers n whose sum of prime indices A056239(n) is at least twice the number of prime indices A001222(n).

Original entry on oeis.org

1, 3, 5, 9, 10, 15, 25, 27, 30, 45, 50, 75, 81, 90, 100, 125, 135, 150, 225, 243, 250, 270, 300, 375, 405, 450, 500, 625, 675, 729, 750, 810, 900, 1000, 1125, 1215, 1250, 1350, 1500, 1875, 2025, 2187, 2250, 2430, 2500, 2700, 3000, 3125, 3375, 3645, 3750, 4050

Offset: 1

Gus Wiseman, May 16 2021

nonn

A number is 5-smooth if its prime divisors are all <= 5.

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.

			The sequence of terms together with their prime indices begins:
       1: {}            125: {3,3,3}
       3: {2}           135: {2,2,2,3}
       5: {3}           150: {1,2,3,3}
       9: {2,2}         225: {2,2,3,3}
      10: {1,3}         243: {2,2,2,2,2}
      15: {2,3}         250: {1,3,3,3}
      25: {3,3}         270: {1,2,2,2,3}
      27: {2,2,2}       300: {1,1,2,3,3}
      30: {1,2,3}       375: {2,3,3,3}
      45: {2,2,3}       405: {2,2,2,2,3}
      50: {1,3,3}       450: {1,2,2,3,3}
      75: {2,3,3}       500: {1,1,3,3,3}
      81: {2,2,2,2}     625: {3,3,3,3}
      90: {1,2,2,3}     675: {2,2,2,3,3}
     100: {1,1,3,3}     729: {2,2,2,2,2,2}

Allowing any number of parts and sum gives A051037, counted by A001399.
These are Heinz numbers of the partitions counted by A266755.
Allowing parts > 5 gives A344291, counted by A110618.
The non-3-smooth case is A344294, counted by A325691.
Requiring the sum of prime indices to be even gives A344295.
A000070 counts non-multigraphical partitions, ranked by A344292.
A025065 counts partitions of n with >= n/2 parts, ranked by A344296.
A035363 counts partitions of n with n/2 parts, ranked by A340387.
A056239 adds up prime indices, row sums of A112798.
A300061 ranks partitions of even numbers, with 5-smooth case A344297.
Cf. A000041, A000244, A026811, A080193, A244990, A261144, A279622.

Select[Range[1000],PrimeOmega[#]<=Total[Cases[FactorInteger[#],{p_,k_}:>k*PrimePi[p]]]/2&&Max@@First/@FactorInteger[#]<=5&]

Intersection of A051037 and A344291.

A344294 5-smooth but not 3-smooth numbers k such that A056239(k) >= 2*A001222(k).

Original entry on oeis.org

5, 10, 15, 25, 30, 45, 50, 75, 90, 100, 125, 135, 150, 225, 250, 270, 300, 375, 405, 450, 500, 625, 675, 750, 810, 900, 1000, 1125, 1215, 1250, 1350, 1500, 1875, 2025, 2250, 2430, 2500, 2700, 3000, 3125, 3375, 3645, 3750, 4050, 4500, 5000, 5625, 6075, 6250

Offset: 1

Gus Wiseman, May 16 2021

nonn

A number is d-smooth iff its prime divisors are all <= d.

A prime index of k is a number m such that prime(m) divides k, and the multiset of prime indices of k is row k of A112798. This row has length A001222(k) and sum A056239(k).

			The sequence of terms together with their prime indices begins:
       5: {3}           270: {1,2,2,2,3}
      10: {1,3}         300: {1,1,2,3,3}
      15: {2,3}         375: {2,3,3,3}
      25: {3,3}         405: {2,2,2,2,3}
      30: {1,2,3}       450: {1,2,2,3,3}
      45: {2,2,3}       500: {1,1,3,3,3}
      50: {1,3,3}       625: {3,3,3,3}
      75: {2,3,3}       675: {2,2,2,3,3}
      90: {1,2,2,3}     750: {1,2,3,3,3}
     100: {1,1,3,3}     810: {1,2,2,2,2,3}
     125: {3,3,3}       900: {1,1,2,2,3,3}
     135: {2,2,2,3}    1000: {1,1,1,3,3,3}
     150: {1,2,3,3}    1125: {2,2,3,3,3}
     225: {2,2,3,3}    1215: {2,2,2,2,2,3}
     250: {1,3,3,3}    1250: {1,3,3,3,3}

Allowing any number of parts and sum gives A080193, counted by A069905.
The partitions with these Heinz numbers are counted by A325691.
Relaxing the smoothness conditions gives A344291, counted by A110618.
Allowing 3-smoothness gives A344293, counted by A266755.
A025065 counts partitions of n with at least n/2 parts, ranked by A344296.
A035363 counts partitions of n whose length is n/2, ranked by A340387.
A051037 lists 5-smooth numbers (complement: A279622).
A056239 adds up prime indices, row sums of A112798.
A257993 gives the least gap of the partition with Heinz number n.
A300061 lists numbers with even sum of prime indices (5-smooth: A344297).
A342050/A342051 list Heinz numbers of partitions with even/odd least gap.
Cf. A000041, A001399, A002865, A027336, A244990, A261144, A344295.

Select[Range[1000],PrimeOmega[#]<=Total[Cases[FactorInteger[#],{p_,k_}:>k*PrimePi[p]]]/2&&Max@@First/@FactorInteger[#]==5&]

Intersection of A080193 and A344291.

A344297 Heinz numbers of integer partitions of even numbers with no part greater than 3.

Original entry on oeis.org

1, 3, 4, 9, 10, 12, 16, 25, 27, 30, 36, 40, 48, 64, 75, 81, 90, 100, 108, 120, 144, 160, 192, 225, 243, 250, 256, 270, 300, 324, 360, 400, 432, 480, 576, 625, 640, 675, 729, 750, 768, 810, 900, 972, 1000, 1024, 1080, 1200, 1296, 1440, 1600, 1728, 1875, 1920

Offset: 1

Gus Wiseman, May 16 2021

nonn

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: {}                 81: {2,2,2,2}
       3: {2}                90: {1,2,2,3}
       4: {1,1}             100: {1,1,3,3}
       9: {2,2}             108: {1,1,2,2,2}
      10: {1,3}             120: {1,1,1,2,3}
      12: {1,1,2}           144: {1,1,1,1,2,2}
      16: {1,1,1,1}         160: {1,1,1,1,1,3}
      25: {3,3}             192: {1,1,1,1,1,1,2}
      27: {2,2,2}           225: {2,2,3,3}
      30: {1,2,3}           243: {2,2,2,2,2}
      36: {1,1,2,2}         250: {1,3,3,3}
      40: {1,1,1,3}         256: {1,1,1,1,1,1,1,1}
      48: {1,1,1,1,2}       270: {1,2,2,2,3}
      64: {1,1,1,1,1,1}     300: {1,1,2,3,3}
      75: {2,3,3}           324: {1,1,2,2,2,2}

These partitions are counted by A007980.
Including partitions of odd numbers gives A051037 (complement: A279622).
Allowing parts > 3 gives A300061.
A001358 lists semiprimes.
A035363 counts partitions whose length is half their sum, ranked by A340387.
A056239 adds up prime indices, row sums of A112798.
Cf. A001399, A002620, A030229, A080193, A244990, A261144, A266755, A344291, A344293, A344294.

Select[Range[1000],EvenQ[Total[Cases[FactorInteger[#],{p_,k_}:>k*PrimePi[p]]]]&&Max@@First/@FactorInteger[#]<=Prime[3]&]

Intersection of A051037 and A300061.

A344416 Heinz numbers of integer partitions whose sum is even and is at most twice the greatest part.

Original entry on oeis.org

3, 4, 7, 9, 10, 12, 13, 19, 21, 22, 25, 28, 29, 30, 34, 37, 39, 40, 43, 46, 49, 52, 53, 55, 57, 61, 62, 63, 66, 70, 71, 76, 79, 82, 84, 85, 87, 88, 89, 91, 94, 101, 102, 107, 111, 112, 113, 115, 116, 117, 118, 121, 129, 130, 131, 133, 134, 136, 138, 139, 146

Offset: 1

Gus Wiseman, May 20 2021

nonn

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.

Also numbers m whose sum of prime indices A056239(m) is even and is at most twice the greatest prime index A061395(m).

			The sequence of terms together with their prime indices begins:
      3: {2}         37: {12}          71: {20}
      4: {1,1}       39: {2,6}         76: {1,1,8}
      7: {4}         40: {1,1,1,3}     79: {22}
      9: {2,2}       43: {14}          82: {1,13}
     10: {1,3}       46: {1,9}         84: {1,1,2,4}
     12: {1,1,2}     49: {4,4}         85: {3,7}
     13: {6}         52: {1,1,6}       87: {2,10}
     19: {8}         53: {16}          88: {1,1,1,5}
     21: {2,4}       55: {3,5}         89: {24}
     22: {1,5}       57: {2,8}         91: {4,6}
     25: {3,3}       61: {18}          94: {1,15}
     28: {1,1,4}     62: {1,11}       101: {26}
     29: {10}        63: {2,2,4}      102: {1,2,7}
     30: {1,2,3}     66: {1,2,5}      107: {28}
     34: {1,7}       70: {1,3,4}      111: {2,12}

These partitions are counted by A000070 = even-indexed terms of A025065.
The opposite version appears to be A320924, counted by A209816.
The opposite version with odd weights allowed appears to be A322109.
The conjugate opposite version allowing odds is A344291, counted by A110618.
The conjugate version is A344296, also counted by A025065.
The conjugate opposite version is A344413, counted by A209816.
Allowing odd weight gives A344414.
The case of equality is A344415, counted by A035363.
A001222 counts prime factors with multiplicity.
A027187 counts partitions of even length, ranked by A028260.
A056239 adds up prime indices, row sums of A112798.
A058696 counts partitions of even numbers, ranked by A300061.
A265640 lists Heinz numbers of palindromic partitions.
A301987 lists numbers whose sum of prime indices equals their product.
A334201 adds up all prime indices except the greatest.
A340387 lists Heinz numbers of partitions whose sum is twice their length.
Cf. A001414, A074761, A316413, A316428, A325037, A325038, A325044, A330950, A344293, A344294, A344297.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],EvenQ[Total[primeMS[#]]]&&Max[primeMS[#]]>=Total[primeMS[#]]/2&]

Intersection of A300061 and A344414.

A322109 Heinz numbers of integer partitions that are the vertex-degrees of some set multipartition (multiset of nonempty sets) with no singletons.

Original entry on oeis.org

1, 4, 8, 9, 12, 16, 18, 24, 25, 27, 30, 32, 36, 40, 45, 48, 49, 50, 54, 60, 63, 64, 70, 72, 75, 80, 81, 84, 90, 96, 98, 100, 105, 108, 112, 120, 121, 125, 126, 128, 135, 140, 144, 147, 150, 154, 160, 162, 165, 168, 169, 175, 180, 189, 192, 196, 198, 200, 210

Offset: 1

Gus Wiseman, Nov 26 2018

nonn

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

Also Heinz numbers of partitions whose greatest part is less than or equal to half the sum of parts, i.e., numbers n whose sum of prime indices A056239(n) is at least twice the greatest prime index A061395(n). - Gus Wiseman, May 23 2021

			Each term paired with its Heinz partition and a realizing set multipartition with no singletons:
   1:      (): {}
   4:    (11): {{1,2}}
   8:   (111): {{1,2,3}}
   9:    (22): {{1,2},{1,2}}
  12:   (211): {{1,2},{1,3}}
  16:  (1111): {{1,2,3,4}}
  18:   (221): {{1,2},{1,2,3}}
  24:  (2111): {{1,2},{1,3,4}}
  25:    (33): {{1,2},{1,2},{1,2}}
  27:   (222): {{1,2,3},{1,2,3}}
  30:   (321): {{1,2},{1,2},{1,3}}
  32: (11111): {{1,2,3,4,5}}
  36:  (2211): {{1,2},{1,2,3,4}}
  40:  (3111): {{1,2},{1,3},{1,4}}

These partitions are counted by A110618.
The even-weight version is A320924.
The conjugate case of equality is A340387.
The conjugate version is A344291.
The opposite conjugate version is A344296.
The opposite version is A344414.
The case of equality is A344415.
The opposite even-weight version is A344416.
A000070 counts non-multigraphical partitions.
A025065 counts palindromic partitions.
A035363 counts partitions into even parts.
A056239 adds up prime indices, row sums of A112798.
A058696 counts partitions of even numbers, ranked by A300061.
A334201 adds up all prime indices except the greatest.
Cf. A000041, A000569, A265640, A283877, A306005, A318361, A320922, A320923, A320925.

nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
sqnopfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[sqnopfacs[n/d],Min@@#>=d&]],{d,Select[Rest[Divisors[n]],!PrimeQ[#]&&SquareFreeQ[#]&]}]]
Select[Range[100],Length[sqnopfacs[Times@@Prime/@nrmptn[#]]]>0&]

A061395(a(n)) <= A056239(a(n))/2.

cp's OEIS Frontend

A340602 Heinz numbers of integer partitions of even rank.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A344291 Numbers whose sum of prime indices is at least twice their number of prime indices (counted with multiplicity).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A344414 Heinz numbers of integer partitions whose sum is at most twice their greatest part.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A340605 Heinz numbers of integer partitions of even positive rank.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A340931 Heinz numbers of integer partitions of odd numbers into an odd number of parts.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A344293 5-smooth numbers n whose sum of prime indices A056239(n) is at least twice the number of prime indices A001222(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A344294 5-smooth but not 3-smooth numbers k such that A056239(k) >= 2*A001222(k).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A344297 Heinz numbers of integer partitions of even numbers with no part greater than 3.

Views

Author

Keywords

Comments

Examples

Crossrefs