A301899 -id:A301899 - cp's OEIS frontend

A325779 Heinz numbers of integer partitions for which every restriction to a subinterval has a different sum.

1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 46, 47, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 71, 73, 74, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 102, 103, 105, 106, 107

Offset: 1

Gus Wiseman, May 20 2019

nonn

First differs from A301899 in having 462.

The enumeration of these partitions by sum is given by A325768.

			Most small numbers are in the sequence. However, the sequence of non-terms together with their prime indices begins:
    4: {1,1}
    8: {1,1,1}
    9: {2,2}
   12: {1,1,2}
   16: {1,1,1,1}
   18: {1,2,2}
   20: {1,1,3}
   24: {1,1,1,2}
   25: {3,3}
   27: {2,2,2}
   28: {1,1,4}
   30: {1,2,3}
   32: {1,1,1,1,1}
   36: {1,1,2,2}
   40: {1,1,1,3}
   44: {1,1,5}
   45: {2,2,3}
   48: {1,1,1,1,2}
   49: {4,4}
   50: {1,3,3}

A subsequence of A005117.

Cf. A000041, A002033, A056239, A103300, A112798, A143823, A169942, A299702, A301899, A325676, A325768, A325769, A325770, A325778.

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

A320057 Heinz numbers of spanning sum-product knapsack partitions.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 25, 26, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 46, 47, 49, 50, 51, 53, 55, 57, 58, 59, 61, 62, 65, 67, 69, 71, 73, 74, 75, 77, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 98, 101, 103, 105

Offset: 1

Gus Wiseman, Oct 04 2018

nonn

A spanning sum-product knapsack partition is a finite multiset m of positive integers such that every sum of products of parts of any multiset partition of m is distinct.
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
Differs from A320058 in having 1155, 1625, 1815, 1875, 1911, ... and lacking 20, 28, 42, 44, 52, ...

			The sequence of all spanning sum-product knapsack partitions begins: (), (1), (2), (1,1), (3), (2,1), (4), (1,1,1), (3,1), (5), (6), (4,1), (3,2), (7), (8), (4,2), (5,1), (9), (3,3), (6,1).
A complete list of sums of products of multiset partitions of the partition (5,4,3,2) is:
        (2*3*4*5) = 120
      (2)+(3*4*5) = 62
      (3)+(2*4*5) = 43
      (4)+(2*3*5) = 34
      (5)+(2*3*4) = 29
      (2*3)+(4*5) = 26
      (2*4)+(3*5) = 23
      (2*5)+(3*4) = 22
    (2)+(3)+(4*5) = 25
    (2)+(4)+(3*5) = 21
    (2)+(5)+(3*4) = 19
    (3)+(4)+(2*5) = 17
    (3)+(5)+(2*4) = 16
    (4)+(5)+(2*3) = 15
  (2)+(3)+(4)+(5) = 14
These are all distinct, and the Heinz number of (5,4,3,2) is 1155, so 1155 belongs to the sequence.

Cf. A001970, A056239, A066739, A108917, A112798, A292886, A299702, A301899, A318949, A319318, A319913.

Cf. A267597, A320052, A320053, A320054, A320055, A320056, A320058.

multWt[n_]:=If[n==1,1,Times@@Cases[FactorInteger[n],{p_,k_}:>PrimePi[p]^k]];
facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Select[Range[100],UnsameQ@@Table[Plus@@multWt/@f,{f,facs[#]}]&]

A320058 Heinz numbers of spanning product-sum knapsack partitions.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Oct 04 2018

nonn

A spanning product-sum knapsack partition is a finite multiset m of positive integers such that every product of sums of parts of any multiset partition of m is distinct.
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
Differs from A320057 in having 20, 28, 42, 44, 52, ... and lacking 1155, 1625, 1815, 1875, 1911, ....

			The sequence of all spanning product-sum knapsack partitions begins: (), (1), (2), (1,1), (3), (2,1), (4), (1,1,1), (3,1), (5), (6), (4,1), (3,2), (7), (8), (3,1,1), (4,2), (5,1), (9), (3,3), (6,1), (4,1,1).
A complete list of products of sums of multiset partitions of the partition (3,1,1) is:
      (1+1+3) = 5
    (1)*(1+3) = 4
    (3)*(1+1) = 6
  (1)*(1)*(3) = 3
These are all distinct, and the Heinz number of (3,1,1) is 20, so 20 belongs to the sequence.

Cf. A001970, A056239, A066739, A108917, A112798, A292886, A299702, A301899, A318949, A319318, A319913.

Cf. A267597, A320052, A320053, A320054, A320055, A320056, A320057.

heinzWt[n_]:=If[n==1,0,Total[Cases[FactorInteger[n],{p_,k_}:>k*PrimePi[p]]]];
facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Select[Range[100],UnsameQ@@Table[Times@@heinzWt/@f,{f,facs[#]}]&]

A325467 Heinz numbers of integer partitions y such that the k-th differences of y are distinct (independently) for all k >= 0.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 46, 47, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 102, 103, 106, 107

Offset: 1

Gus Wiseman, May 03 2019

nonn

First differs from A301899 in having 70 and lacking 105.
First differs from A325398 in having 70.
First differs from A319315 in having 966.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (6,3,1) are (-3,-2).
The zeroth differences of a sequence are the sequence itself, while the k-th differences for k > 0 are the differences of the (k-1)-th differences.
The enumeration of these partitions by sum is given by A325468.

			The sequence of terms together with their prime indices begins:
    1: {}
    2: {1}
    3: {2}
    5: {3}
    6: {1,2}
    7: {4}
   10: {1,3}
   11: {5}
   13: {6}
   14: {1,4}
   15: {2,3}
   17: {7}
   19: {8}
   21: {2,4}
   22: {1,5}
   23: {9}
   26: {1,6}
   29: {10}
   31: {11}
   33: {2,5}
For example, the k-th differences for k = 0...3 of the partition (9,4,2,1) with Heinz number 966 are
   9  4  2  1
  -5 -2 -1
   3  1
  -2
and since the entries of each row are distinct, 966 belongs to the sequence.

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

A subsequence of A005117.

Cf. A056239, A112798, A325366, A325367, A325368, A325397, A325398, A325399, A325400, A325405, A325468.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],And@@Table[UnsameQ@@Differences[primeptn[#],k],{k,0,PrimeOmega[#]}]&]

A316271 FDH numbers of strict non-knapsack partitions.

Original entry on oeis.org

24, 40, 70, 84, 120, 126, 135, 168, 198, 210, 216, 220, 231, 264, 270, 280, 286, 312, 330, 351, 360, 364, 378, 384, 408, 416, 420, 440, 456, 462, 504, 520, 528, 540, 544, 546, 552, 560, 576, 594, 600, 616, 630, 640, 646, 660, 663, 680, 696, 702, 728, 744, 748

Offset: 1

Gus Wiseman, Jun 28 2018

nonn

A strict integer partition is knapsack if every subset has a different sum.

Let f(n) = A050376(n) be the n-th Fermi-Dirac prime. The FDH number of a strict integer partition (y_1,...,y_k) is f(y_1)*...*f(y_k).

			a(1) = 24 is the FDH number of (3,2,1), which is not knapsack because 3 = 2 + 1.

Cf. A000712, A005117, A050376, A056239, A064547, A108917, A213925, A275972, A284640, A299702, A299755, A299757, A301899, A301900.

nn=1000;
sksQ[ptn_]:=And[UnsameQ@@ptn,UnsameQ@@Plus@@@Union[Subsets[ptn]]];
FDfactor[n_]:=If[n==1,{},Sort[Join@@Cases[FactorInteger[n],{p_,k_}:>Power[p,Cases[Position[IntegerDigits[k,2]//Reverse,1],{m_}->2^(m-1)]]]]];
FDprimeList=Array[FDfactor,nn,1,Union];FDrules=MapIndexed[(#1->#2[[1]])&,FDprimeList];
Select[Range[nn],!sksQ[FDfactor[#]/.FDrules]&]

A319319 Heinz numbers of integer partitions such that every distinct submultiset has a different GCD.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 15, 17, 19, 23, 29, 31, 33, 35, 37, 41, 43, 47, 51, 53, 55, 59, 61, 67, 69, 71, 73, 77, 79, 83, 85, 89, 91, 93, 95, 97, 101, 103, 107, 109, 113, 119, 123, 127, 131, 137, 139, 141, 143, 145, 149, 151, 155, 157, 161, 163, 167, 173, 177

Offset: 1

Gus Wiseman, Sep 17 2018

nonn

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

First differs from A304713 (Heinz numbers of pairwise indivisible partitions) at A304713(58) = 165, which is absent from this sequence because its prime indices are {2,3,5} and GCD(2,3) = GCD(2,3,5) = 1. The first term with more than two prime factors is 17719, which has prime indices {6,10,15}. The first term with more than two prime factors that is absent from A318716 is 296851, which has prime indices {12,20,30}.

			The sequence of partitions whose Heinz numbers are in the sequence begins: (), (1), (2), (3), (4), (5), (6), (3,2), (7), (8), (9), (10), (11), (5,2), (4,3), (12), (13), (14), (15), (7,2), (16), (5,3).

Cf. A056239, A108917, A122768, A275972, A299702, A301899, A301900, A304713, A316313, A319315, A319318, A319327.

primeMS[n_]:=If[n===1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],UnsameQ@@GCD@@@Union[Subsets[primeMS[#]]]&]

A316399 Number of strict integer partitions of n such that not every subset has a different average.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 2, 1, 1, 5, 3, 5, 9, 10, 10, 20, 20, 27, 32, 39, 43, 69, 65, 83, 99, 133, 136, 176, 191, 252, 274, 332, 363, 475, 503, 602, 677, 832, 893, 1067, 1186, 1418, 1561, 1797, 2000, 2384, 2602, 2992, 3315, 3853, 4226, 4826, 5383, 6121, 6763

Offset: 1

Gus Wiseman, Jul 01 2018

nonn

			The a(12) = 5 partitions are (5,4,3), (6,4,2), (7,4,1), (5,4,2,1), (6,3,2,1).

Cf. A000009, A108917, A275972, A276024, A284640, A299702, A301899, A301900, A316271, A316313, A316314, A316400, A316402.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&!UnsameQ@@Mean/@Union[Subsets[#]]&]],{n,60}]

a(n) = A000009(n) - A316313(n).

A316400 Number of strict integer partitions of n that are knapsack (every subset has a different sum) but not every subset has a different average.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 4, 1, 2, 4, 6, 4, 13, 6, 13, 17, 15, 12, 31, 26, 27, 23, 36, 41, 56, 39, 47, 74, 71, 55, 101, 94, 110, 97, 145, 148, 189, 142, 214, 232, 280, 206, 362, 332, 414, 347, 504, 469, 658, 492, 726, 697, 867, 687, 1100, 933

Offset: 1

Gus Wiseman, Jul 01 2018

nonn

			The a(21) = 13 partitions:
(8,7,6), (9,7,5), (10,7,4), (11,7,3), (12,7,2), (13,7,1),
(7,6,5,3), (8,6,4,3), (9,7,4,1), (10,6,3,2), (11,6,3,1), (12,4,3,2), (12,5,3,1).

Cf. A000009, A108917, A275972, A299702, A301899, A301900, A316271, A316313, A316314, A316399, A316401.

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

A319327 Heinz numbers of integer partitions such that every distinct submultiset has a different LCM.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 15, 17, 19, 23, 29, 31, 33, 35, 37, 41, 43, 47, 51, 53, 55, 59, 61, 67, 69, 71, 73, 77, 79, 83, 85, 89, 91, 93, 95, 97, 101, 103, 107, 109, 113, 119, 123, 127, 131, 137, 139, 141, 143, 145, 149, 151, 155, 157, 161, 163, 165, 167, 173

Offset: 1

Gus Wiseman, Sep 17 2018

nonn

Note that such a Heinz number is necessarily squarefree, as such a partition is necessarily strict.
The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
First differs from A304713 (Heinz numbers of pairwise indivisible partitions) at A304713(642) = 2093, which is absent from this sequence because its prime indices are {4,6,9} and LCM(4,9) = LCM(4,6,9) = 36.

			The sequence of partitions whose Heinz numbers are in the sequence begins: (), (1), (2), (3), (4), (5), (6), (3,2), (7), (8), (9), (10), (11), (5,2), (4,3), (12), (13), (14), (15), (7,2).

Cf. A056239, A108917, A122768, A275972, A299702, A301899, A301900, A304713, A316313, A319315, A319319, A319320.

primeMS[n_]:=If[n===1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],UnsameQ@@LCM@@@Union[Subsets[primeMS[#]]]&]

A321144 Irregular triangle where T(n,k) is the number of divisors of n whose prime indices sum to k.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Oct 28 2018

The rows are all palindromes.

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.

			Triangle begins:
  1
  1  1
  1  0  1
  1  1  1
  1  0  0  1
  1  1  1  1
  1  0  0  0  1
  1  1  1  1
  1  0  1  0  1
  1  1  0  1  1
  1  0  0  0  0  1
  1  1  2  1  1
  1  0  0  0  0  0  1
  1  1  0  0  1  1
  1  0  1  1  0  1
  1  1  1  1  1
  1  0  0  0  0  0  0  1
  1  1  1  1  1  1
  1  0  0  0  0  0  0  0  1
  1  1  1  1  1  1
  1  0  1  0  1  0  1
  1  1  0  0  0  1  1
  1  0  0  0  0  0  0  0  0  1
  1  1  2  2  1  1
  1  0  0  1  0  0  1
  1  1  0  0  0  0  1  1
  1  0  1  0  1  0  1
  1  1  1  0  1  1  1
  1  0  0  0  0  0  0  0  0  0  1
  1  1  1  2  1  1  1

Row lengths are A056239. Number of nonzero entries in row n is A299701(n).

Cf. A000005, A112798, A276024, A301854, A301899.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]
Table[Count[Total/@primeMS/@Divisors[n],k],{n,20},{k,0,Total[primeMS[n]]}]

cp's OEIS Frontend

A325779 Heinz numbers of integer partitions for which every restriction to a subinterval has a different sum.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A320057 Heinz numbers of spanning sum-product knapsack partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A320058 Heinz numbers of spanning product-sum knapsack partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325467 Heinz numbers of integer partitions y such that the k-th differences of y are distinct (independently) for all k >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A316271 FDH numbers of strict non-knapsack partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A319319 Heinz numbers of integer partitions such that every distinct submultiset has a different GCD.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A316399 Number of strict integer partitions of n such that not every subset has a different average.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A316400 Number of strict integer partitions of n that are knapsack (every subset has a different sum) but not every subset has a different average.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A319327 Heinz numbers of integer partitions such that every distinct submultiset has a different LCM.

Views

Author

Keywords

Comments

Examples

Crossrefs