A366738 -id:A366738 - cp's OEIS frontend

A299701 Number of distinct subset-sums of the integer partition with Heinz number n.

1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 5, 2, 4, 4, 5, 2, 6, 2, 6, 4, 4, 2, 6, 3, 4, 4, 6, 2, 7, 2, 6, 4, 4, 4, 7, 2, 4, 4, 7, 2, 8, 2, 6, 6, 4, 2, 7, 3, 6, 4, 6, 2, 8, 4, 8, 4, 4, 2, 8, 2, 4, 5, 7, 4, 8, 2, 6, 4, 7, 2, 8, 2, 4, 6, 6, 4, 8, 2, 8, 5, 4, 2, 9, 4, 4, 4

Offset: 1

Gus Wiseman, Feb 17 2018

nonn

An integer n is a subset-sum of an integer partition y if there exists a submultiset of y with sum n. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

Position of first appearance of n appears to be A259941(n-1) = least Heinz number of a complete partition of n-1. - Gus Wiseman, Nov 16 2023

			The subset-sums of (5,1,1,1) are {0, 1, 2, 3, 5, 6, 7, 8} so a(88) = 8.
The subset-sums of (4,3,1) are {0, 1, 3, 4, 5, 7, 8} so a(70) = 7.

Alois P. Heinz, Table of n, a(n) for n = 1..20000

Cf. A000005, A000041, A000720, A001222, A056239, A108917, A112798, A122111, A122768, A215366, A276024, A284640, A296150, A299702.
Positions of first appearances are A259941.
The triangle for this rank statistic is A365658.
The semi version is A366739, sum A366738, strict A366741.
Cf. A032302, A070933, A304792, A304793, A365543, A365920, A367095.

Table[Length[Union[Total/@Subsets[Join@@Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]],{n,100}]

a(n) <= A000005(n) and a(n) = A000005(n) iff n is the Heinz number of a knapsack partition (A299702).

Comment corrected by Gus Wiseman, Aug 09 2024

A366741 Number of semi-sums of strict integer partitions of n.

Original entry on oeis.org

0, 0, 0, 1, 1, 2, 5, 6, 9, 13, 21, 26, 37, 48, 63, 86, 108, 139, 175, 223, 274, 350, 422, 527, 638, 783, 939, 1146, 1371, 1648, 1957, 2341, 2770, 3285, 3867, 4552, 5353, 6262, 7314, 8529, 9924, 11511, 13354, 15423, 17825, 20529, 23628, 27116, 31139, 35615

Offset: 0

Gus Wiseman, Nov 05 2023

nonn

We define a semi-sum of a multiset to be any sum of a 2-element submultiset. This is different from sums of pairs of elements. For example, 2 is the sum of a pair of elements of {1}, but there are no semi-sums.

			The strict partitions of 9 and their a(9) = 13 semi-sums:
    (9) ->
   (81) -> 9
   (72) -> 9
   (63) -> 9
  (621) -> 3,7,8
   (54) -> 9
  (531) -> 4,6,8
  (432) -> 5,6,7

The non-strict non-binary version is A304792.
The non-binary version is A365925.
The non-strict version is A366738.
A000041 counts integer partitions, strict A000009.
A001358 lists semiprimes, squarefree A006881, conjugate A065119.
A126796 counts complete partitions, ranks A325781, strict A188431.
A276024 counts positive subset-sums of partitions, strict A284640.
A365543 counts partitions with a subset summing to k, complement A046663.
A365661 counts strict partitions w/ subset summing to k, complement A365663.
A365924 counts incomplete partitions, ranks A365830, strict A365831.
A366739 counts semi-sums of prime indices, firsts A367097.
Cf. A008967, A122768, A299701, A364272, A364350, A365541, A365832, A366753.

Table[Total[Length[Union[Total/@Subsets[#, {2}]]]&/@Select[IntegerPartitions[n], UnsameQ@@#&]], {n,0,30}]

A366740 Positive integers whose semiprime divisors do not all have different Heinz weights (sum of prime indices, A056239).

Original entry on oeis.org

90, 180, 210, 270, 360, 420, 450, 462, 525, 540, 550, 630, 720, 810, 840, 858, 900, 910, 924, 990, 1050, 1080, 1100, 1155, 1170, 1260, 1326, 1350, 1386, 1440, 1470, 1530, 1575, 1620, 1650, 1666, 1680, 1710, 1716, 1800, 1820, 1848, 1870, 1890, 1911, 1938, 1980

Offset: 1

Gus Wiseman, Nov 05 2023

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.
From Robert Israel, Nov 06 2023: (Start)
Positive integers divisible by the product of four primes, prime(i)*prime(j)*prime(k)*prime(l), i < j <= k < l, with i + l = j + k.
All positive multiples of terms are terms. (End)

			The semiprime divisors of 90 are (6,9,10,15), with prime indices ({1,2},{2,2},{1,3},{2,3}) with sums (3,4,4,5), which are not all different, so 90 is in the sequence.
The terms together with their prime indices begin:
    90: {1,2,2,3}
   180: {1,1,2,2,3}
   210: {1,2,3,4}
   270: {1,2,2,2,3}
   360: {1,1,1,2,2,3}
   420: {1,1,2,3,4}
   450: {1,2,2,3,3}
   462: {1,2,4,5}
   525: {2,3,3,4}
   540: {1,1,2,2,2,3}
   550: {1,3,3,5}
   630: {1,2,2,3,4}
   720: {1,1,1,1,2,2,3}

The complement is too dense.
For all divisors instead of just semiprimes we have A299729, strict A316402.
Distinct semi-sums of prime indices are counted by A366739.
Partitions of this type are counted by A366753, non-binary A366754.
A001222 counts prime factors (or prime indices), distinct A001221.
A001358 lists semiprimes, squarefree A006881, conjugate A065119.
A056239 adds up prime indices, row sums of A112798.
A299701 counts distinct subset-sums of prime indices, positive A304793.
A299702 ranks knapsack partitions, counted by A108917, strict A275972.
Semiprime divisors are listed by A367096 and have:
- square count: A056170
- sum: A076290
- squarefree count: A079275
- count: A086971
- firsts: A220264
Cf. A000720, A001248, A008967, A365541, A365920, A366737, A366738, A366741, A367093, A367095, A367097.

N:= 10^4: # for terms <= N
P:= select(isprime, [$1..N]): nP:= nops(P):
R:= {}:
for i from 1 while P[i]*P[i+1]^2*P[i+2] < N do
  for j from i+1 while P[i]*P[j]^2 * P[j+1] < N do
    for k from j do
      l:= j+k-i;
      if l <= k or l > nP then break fi;
      v:= P[i]*P[j]*P[k]*P[l];
      if v <= N then
        R:= R union {seq(t,t=v..N,v)};
      fi
od od od:
sort(convert(R,list)); # Robert Israel, Nov 06 2023

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000],!UnsameQ@@Total/@Union[Subsets[prix[#],{2}]]&]

These are numbers k such that A086971(k) > A366739(k).

A366754 Number of non-knapsack integer partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 4, 4, 10, 13, 23, 27, 52, 60, 94, 118, 175, 213, 310, 373, 528, 643, 862, 1044, 1403, 1699, 2199, 2676, 3426, 4131, 5256, 6295, 7884, 9479, 11722, 14047, 17296, 20623, 25142, 29942, 36299, 43081, 51950, 61439, 73668, 87040, 103748, 122149, 145155, 170487

Offset: 0

Gus Wiseman, Nov 08 2023

nonn

A multiset is non-knapsack if there exist two different submultisets with the same sum.

			The a(4) = 1 through a(9) = 13 partitions:
  (211)  (2111)  (321)    (3211)    (422)      (3321)
                 (2211)   (22111)   (431)      (4221)
                 (3111)   (31111)   (3221)     (4311)
                 (21111)  (211111)  (4211)     (5211)
                                    (22211)    (32211)
                                    (32111)    (33111)
                                    (41111)    (42111)
                                    (221111)   (222111)
                                    (311111)   (321111)
                                    (2111111)  (411111)
                                               (2211111)
                                               (3111111)
                                               (21111111)

The complement is counted by A108917, strict A275972, ranks A299702.
These partitions have ranks A299729.
The strict case is A316402.
The binary version is A366753, ranks A366740.
A000041 counts integer partitions, strict A000009.
A276024 counts positive subset-sums of partitions, strict A284640.
A304792 counts subset-sum of partitions, strict A365925.
A365543 counts partitions with subset-sum k, complement A046663.
A365661 counts strict partitions with subset-sum k, complement A365663.
A366738 counts semi-sums of partitions, strict A366741.
Cf. A002033, A006827, A122768, A126796, A238628, A365923, A365924, A367095.

Table[Length[Select[IntegerPartitions[n], !UnsameQ@@Total/@Union[Subsets[#]]&]], {n,0,15}]

a(n) = A000041(n) - A108917(n).

A366739 Number of distinct semi-sums of the multiset of prime indices of n. Number of distinct sums of prime indices of semiprime divisors of n (counted by A086971).

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Nov 04 2023

nonn

First differs from A086971 at a(90) = 3, A086971(90) = 4.
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.
We define a semi-sum of a multiset to be any sum of a 2-element submultiset. This is different from sums of pairs of elements. For example, 2 is the sum of a pair of elements of {1}, but there are no semi-sums.

			The prime indices of 90 are {1,2,2,3}, with semi-sums
  3 = 1+2
  4 = 1+3 (or 2+2)
  5 = 2+3
so a(90) = 3.
Alternatively, the semiprime divisors of 90 are (6,9,10,15), with prime indices ({1,2},{2,2},{1,3},{2,3}) with sums (3,4,4,5) so a(90) = 3.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences related to prime indices in the factorization of n.

The non-binary version is A299701.
Summing over partitions gives A366738, strict A366741.
For all sums of pairs of elements we have A367095.
Positions of first appearances are A367097.
A001222 counts prime factors (or prime indices), distinct A001221.
A001358 lists semiprimes, squarefree A006881, conjugate A065119.
A056239 adds up prime indices, row sums of A112798.
A299702 ranks knapsack partitions, counted by A108917.
Semiprime divisors are listed by A367096 and have:
- square count: A056170
- sum: A076290
- squarefree count: A079275
- count: A086971
- firsts: A220264
Cf. A000005, A000720, A001248, A008967, A117855, A304792, A304793, A365541, A365920, A366740, A366753, A367093.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Union[Total/@Subsets[prix[n],{2}]]],{n,100}]

A366739(n) = #Set(apply(d->((f)->sum(i=1,#f~,f[i,2]*primepi(f[i,1])))(factor(d)), select(d->2==bigomega(d), divisors(n)))); \\ Antti Karttunen, Jan 20 2025

a(n) <= A086971(n). - Antti Karttunen, Jan 20 2025

Data section extended to a(105) by Antti Karttunen, Jan 20 2025

A367095 Number of distinct sums of pairs (repeats allowed) of prime indices of n.

Original entry on oeis.org

0, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 3, 3, 1, 1, 3, 1, 3, 3, 3, 1, 3, 1, 3, 1, 3, 1, 5, 1, 1, 3, 3, 3, 3, 1, 3, 3, 3, 1, 6, 1, 3, 3, 3, 1, 3, 1, 3, 3, 3, 1, 3, 3, 3, 3, 3, 1, 5, 1, 3, 3, 1, 3, 6, 1, 3, 3, 6, 1, 3, 1, 3, 3, 3, 3, 6, 1, 3, 1, 3, 1, 6, 3, 3, 3, 3, 1, 5, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 1, 6, 1, 3, 5

Offset: 1

Gus Wiseman, Nov 06 2023

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.

Is the image missing only 2 and 4?

			The prime indices of 15 are {2,3}, with sums of pairs:
  2+2 = 4
  2+3 = 5
  3+3 = 6
so a(15) = 3.
The prime indices of 180 are {1,1,2,2,3}, with sums of pairs:
  1+1 = 2
  1+2 = 3
  1+3 = 4
  2+2 = 4
  2+3 = 5
  3+3 = 6
so a(180) = 5.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences related to prime indices in the factorization of n.

Depends only on squarefree kernel A007947. (Even more exactly, on A322591 - Antti Karttunen, Jan 20 2025)
Positions of first appearances appear to be a subset of A325986.
For 2-element submultisets we have A366739, for all submultisets A299701.
A001222 counts prime factors (also indices), distinct A001221.
A001358 lists semiprimes, squarefree A006881, conjugate A065119.
A056239 adds up prime indices, row sums of A112798.
A304793 counts positive subset-sums of prime indices.
A367096 lists semiprime divisors, count A086971.
Cf. A001248, A004526, A008967, A366737, A366738, A366740, A367093, A367097.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Union[Total/@Tuples[prix[n],2]]],{n,100}]

A367095(n) = if(1==n, 0, my(pis=apply(primepi,factor(n)[,1]), pairsums = vector(binomial(1+#pis,2)), k=0); for(i=1,#pis,for(j=i,#pis,k++; pairsums[k] = pis[i]+pis[j])); #Set(pairsums)); \\ Antti Karttunen, Jan 20 2025

Data section extended to a(105) by Antti Karttunen, Jan 20 2025

A367093 Least positive integer with n more semiprime divisors than semi-sums of prime indices.

Original entry on oeis.org

1, 90, 630, 2310, 6930, 34650, 30030, 90090, 450450, 570570, 510510, 1531530, 7657650, 14804790, 11741730, 9699690, 29099070, 145495350

Offset: 0

Gus Wiseman, Nov 05 2023

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.
We define a semi-sum of a multiset to be any sum of a 2-element submultiset. This is different from sums of pairs of elements. For example, 2 is the sum of a pair of elements of {1}, but there are no semi-sums.
Are all primorials after 210 included?

			The terms together with their prime indices begin:
       1: {}
      90: {1,2,2,3}
     630: {1,2,2,3,4}
    2310: {1,2,3,4,5}
    6930: {1,2,2,3,4,5}
   34650: {1,2,2,3,3,4,5}
   30030: {1,2,3,4,5,6}
   90090: {1,2,2,3,4,5,6}
  450450: {1,2,2,3,3,4,5,6}
  570570: {1,2,3,4,5,6,8}
  510510: {1,2,3,4,5,6,7}

The first part (semiprime divisors) is A086971, firsts A220264.
The second part (semi-sums of prime indices) is A366739, firsts A367097.
All sums of pairs of prime indices are counted by A367095.
The non-binary version is A367105.
A001222 counts prime factors (or prime indices), distinct A001221.
A001358 lists semiprimes, squarefree A006881, conjugate A065119.
A056239 adds up prime indices, row sums of A112798.
A299701 counts subset-sums of prime indices, positive A304793.
Semiprime divisors are listed by A367096 and have:
- square count: A056170
- sum: A076290
- squarefree count: A079275
- count: A086971
- firsts: A220264
Cf. A000720, A001248, A008967, A117855, A304792, A365541, A365920, A366738, A366740, A366753.

nn=10000;
w=Table[Length[Union[Subsets[prix[n],{2}]]]-Length[Union[Total/@Subsets[prix[n],{2}]]],{n,nn}];
spnm[y_]:=Max@@NestWhile[Most,y,Union[#]!=Range[0,Max@@#]&];
Table[Position[w,k][[1,1]],{k,0,spnm[w]}]

from itertools import count
from sympy import factorint, primepi
from sympy.utilities.iterables import multiset_combinations
def A367093(n):
    for k in count(1):
        c, a = 0, set()
        for s in (sum(p) for p in multiset_combinations({primepi(i):j for i,j in factorint(k).items()},2)):
            if s not in a:
                a.add(s)
            else:
                c += 1
            if c > n:
                break
        if c == n:
            return k # Chai Wah Wu, Nov 13 2023

a(n) is the least positive integer such that A086971(a(n)) - A366739(a(n)) = n.

a(12)-a(16) from Chai Wah Wu, Nov 13 2023

a(17) from Chai Wah Wu, Nov 18 2023

A367404 Triangle read by rows where T(n,k) is the number of integer partitions of n with a semi-sum k.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 3, 2, 2, 2, 5, 3, 4, 2, 3, 7, 5, 6, 4, 3, 3, 11, 7, 9, 6, 6, 3, 4, 15, 11, 13, 10, 9, 6, 4, 4, 22, 15, 20, 13, 15, 9, 8, 4, 5, 30, 22, 27, 21, 21, 15, 12, 8, 5, 5, 42, 30, 39, 28, 30, 21, 20, 12, 10, 5, 6, 56, 42, 53, 41, 42, 33, 28, 20, 15, 10, 6, 6

Offset: 2

Gus Wiseman, Nov 17 2023

We define a semi-sum of a multiset to be any sum of a 2-element submultiset. This is different from sums of pairs of elements. For example, 2 is the sum of a pair of elements of {1}, but there are no semi-sums.

			The partition y = (3,2,1,1) has semi-sum 3 = 2+1, but no semi-sum 6, so y is counted under T(7,3) but not under T(7,6).
Triangle begins:
   1
   1   1
   2   1   2
   3   2   2   2
   5   3   4   2   3
   7   5   6   4   3   3
  11   7   9   6   6   3   4
  15  11  13  10   9   6   4   4
  22  15  20  13  15   9   8   4   5
  30  22  27  21  21  15  12   8   5   5
  42  30  39  28  30  21  20  12  10   5   6
  56  42  53  41  42  33  28  20  15  10   6   6
  77  56  73  55  60  42  44  28  25  15  12   6   7
Row n = 7 counts the following partitions:
  (511)      (421)     (331)    (421)   (511)  (61)
  (4111)     (3211)    (322)    (4111)  (421)  (52)
  (3211)     (2221)    (3211)   (322)   (331)  (43)
  (31111)    (22111)   (31111)  (3211)
  (22111)    (211111)  (2221)
  (211111)             (22111)
  (1111111)

Column k = 0 is A000041.
Column n = k is A004526.
The complement for all submultisets is A046663, strict A365663.
For subsets instead of partitions we have A365541, non-binary A365381.
The non-binary version is A365543, strict A365661.
Row sums are A366738.
The strict case is A367405.
Cf. A122768, A108917, A299701, A304792, A364272, A364911, A365658.

Table[Length[Select[IntegerPartitions[n], MemberQ[Total/@Subsets[#, {2}],k]&]], {n,2,10}, {k,2,n}]

A367405 Triangle read by rows where T(n,k) is the number of strict integer partitions of n with two distinct parts summing to k.

Original entry on oeis.org

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

Offset: 3

Gus Wiseman, Nov 18 2023

			Triangle begins:
  1
  0  1
  0  0  2
  1  1  1  2
  1  0  1  1  3
  1  1  1  1  2  3
  1  1  1  2  2  2  4
  2  2  3  2  3  2  3  4
  2  2  3  2  3  3  3  3  5
  3  2  4  3  4  4  5  3  4  5
  3  3  5  4  4  5  5  5  4  4  6
  4  3  6  5  6  5  7  5  7  4  5  6
  5  5  7  7  8  7  8  8  7  7  5  5  7
  6  5  9  8 10  7 10  9 10  7  9  5  6  7
  7  7 10 10 12 11 11 11 12 10  9  9  6  6  8
  9  7 13 11 15 12 13 13 15 13 13  9 11  6  7  8
Row n = 9 counts the following strict partitions:
  (6,2,1)  (5,3,1)  (4,3,2)  (5,3,1)  (6,2,1)  (6,2,1)  (8,1)
                             (4,3,2)  (4,3,2)  (5,3,1)  (7,2)
                                                        (6,3)
                                                        (5,4)
Row n = 13 counts the following strict partitions (A=10, B=11, C=12):
  A21   931   841   751   652   751   841   931   A21  A21  C1
  7321  7321  832   742   643   7321  742   832   832  931  B2
  6421  5431  7321  6421  6421  652   7321  7321  742  841  A3
              6421  5431  5431  6421  643   643   652  751  94
              5431              5431  5431  6421            85
                                                            76

Column n = k is A004526.
Column k = 3 is A025148.
For subsets instead of partitions we have A365541, non-binary A365381.
The non-binary version is A365661, non-strict A365543.
The non-binary complement is A365663, non-strict A046663.
Row sums are A366741, non-strict A366738.
The non-strict version is A367404.
Cf. A000041, A088809, A093971, A122768, A108917, A284640, A304792, A364272, A364911, A365658.

Table[Length[Select[IntegerPartitions[n], UnsameQ@@#&&MemberQ[Total/@Subsets[#,{2}], k]&]], {n,3,10}, {k,3,n}]

A366753 Number of integer partitions of n without all different sums of two-element submultisets.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 4, 9, 11, 22, 27, 48, 61, 98, 123, 188, 237, 345, 435, 611, 765, 1046, 1305, 1741, 2165, 2840, 3502, 4527, 5562, 7083, 8650, 10908, 13255, 16545, 20016, 24763, 29834, 36587, 43911, 53514, 63964, 77445, 92239, 111015, 131753

Offset: 0

Gus Wiseman, Nov 07 2023

nonn

			The two-element submultisets of y = {1,1,1,2,2,3} are {1,1}, {1,2}, {1,3}, {2,2}, {2,3}, with sums 2, 3, 4, 4, 5, which are not all different, so y is counted under a(10).
The a(8) = 1 through a(13) = 11 partitions:
  (3221)  (32211)  (4321)    (33221)    (4332)      (43321)
                   (32221)   (43211)    (5331)      (53221)
                   (322111)  (322211)   (5421)      (53311)
                             (3221111)  (43221)     (54211)
                                        (322221)    (332221)
                                        (332211)    (432211)
                                        (432111)    (3222211)
                                        (3222111)   (3322111)
                                        (32211111)  (4321111)
                                                    (32221111)
                                                    (322111111)

Semiprime divisors are counted by A086971, distinct sums A366739.
The non-binary complement is A108917, strict A275972, ranks A299702.
These partitions have ranks A366740.
The non-binary version is A366754, strict A316402, ranks A299729.
A276024 counts positive subset-sums of partitions, strict A284640.
A304792 counts subset-sum of partitions, strict A365925.
A365543 counts partitions with a subset-sum k, complement A046663.
A365661 counts strict partitions with a subset-sum k, complement A365663.
A366738 counts semi-sums of partitions, strict A366741.
A367096 lists semiprime divisors, row sums A076290.
Cf. A002033, A001358, A006827, A008967, A122768, A126796, A365923, A365924, A367093, A367095.

Table[Length[Select[IntegerPartitions[n],!UnsameQ@@Total/@Union[Subsets[#,{2}]]&]],{n,0,30}]

cp's OEIS Frontend

A299701 Number of distinct subset-sums of the integer partition with Heinz number n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A366741 Number of semi-sums of strict integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A366740 Positive integers whose semiprime divisors do not all have different Heinz weights (sum of prime indices, A056239).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A366754 Number of non-knapsack integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A366739 Number of distinct semi-sums of the multiset of prime indices of n. Number of distinct sums of prime indices of semiprime divisors of n (counted by A086971).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A367095 Number of distinct sums of pairs (repeats allowed) of prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A367093 Least positive integer with n more semiprime divisors than semi-sums of prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

Formula

Extensions