A325388 -id:A325388 - cp's OEIS frontend

A320348 Number of partition into distinct parts (a_1, a_2, ... , a_m) (a_1 > a_2 > ... > a_m and Sum_{k=1..m} a_k = n) such that a1 - a2, a2 - a_3, ... , a_{m-1} - a_m, a_m are different.

1, 1, 1, 2, 3, 2, 4, 4, 4, 6, 9, 7, 13, 12, 13, 16, 22, 17, 28, 28, 31, 36, 50, 45, 63, 62, 74, 78, 102, 92, 123, 123, 146, 148, 191, 181, 228, 233, 280, 283, 348, 350, 420, 437, 518, 523, 616, 641, 727, 774, 884, 911, 1038, 1102, 1240, 1292, 1463, 1530, 1715, 1861, 2002

Offset: 1

Seiichi Manyama, Oct 11 2018

nonn

Also the number of integer partitions of n whose parts cover an initial interval of positive integers with distinct multiplicities. Also the number of integer partitions of n whose multiplicities cover an initial interval of positive integers and are distinct (see A048767 for a bijection). - Gus Wiseman, May 04 2019

			n = 9
[9]        *********  a_1 = 9.
           ooooooooo
------------------------------------
[8, 1]             *        a_2 = 1.
            *******o  a_1 - a_2 = 7.
            oooooooo
------------------------------------
[7, 2]            **        a_2 = 2.
             *****oo  a_1 - a_2 = 5.
             ooooooo
------------------------------------
[5, 4]          ****        a_2 = 4.
               *oooo  a_1 - a_2 = 1.
               ooooo
------------------------------------
a(9) = 4.
From _Gus Wiseman_, May 04 2019: (Start)
The a(1) = 1 through a(11) = 9 strict partitions with distinct differences (where the last part is taken to be 0) are the following (A = 10, B = 11). The Heinz numbers of these partitions are given by A325388.
  (1)  (2)  (3)  (4)   (5)   (6)   (7)   (8)   (9)   (A)    (B)
                 (31)  (32)  (51)  (43)  (53)  (54)  (64)   (65)
                       (41)        (52)  (62)  (72)  (73)   (74)
                                   (61)  (71)  (81)  (82)   (83)
                                                     (91)   (92)
                                                     (631)  (A1)
                                                            (632)
                                                            (641)
                                                            (731)
The a(1) = 1 through a(10) = 6 partitions covering an initial interval of positive integers with distinct multiplicities are the following. The Heinz numbers of these partitions are given by A325326.
  1  11  111  211   221    21111   2221     22211     22221      222211
              1111  2111   111111  22111    221111    2211111    322111
                    11111          211111   2111111   21111111   2221111
                                   1111111  11111111  111111111  22111111
                                                                 211111111
                                                                 1111111111
The a(1) = 1 through a(10) = 6 partitions whose multiplicities cover an initial interval of positive integers and are distinct are the following (A = 10). The Heinz numbers of these partitions are given by A325337.
  (1)  (2)  (3)  (4)    (5)    (6)    (7)    (8)    (9)    (A)
                 (211)  (221)  (411)  (322)  (332)  (441)  (433)
                        (311)         (331)  (422)  (522)  (442)
                                      (511)  (611)  (711)  (622)
                                                           (811)
                                                           (322111)
(End)

Fausto A. C. Cariboni, Table of n, a(n) for n = 1..500 (terms 1..100 from Seiichi Manyama)
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Cf. A000009, A320347.

Cf. A007294, A007862, A048767, A098859, A179269, A320509, A320510, A325324, A325325, A325349, A325367, A325404, A325468.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&UnsameQ@@Differences[Append[#,0]]&]],{n,30}] (* Gus Wiseman, May 04 2019 *)

A325367 Heinz numbers of integer partitions with distinct differences between successive parts (with the last part taken to be zero).

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 9, 10, 11, 13, 14, 15, 17, 19, 20, 22, 23, 25, 26, 28, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 57, 58, 59, 61, 62, 67, 68, 69, 71, 73, 74, 75, 76, 77, 79, 82, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97

Offset: 1

Gus Wiseman, May 02 2019

nonn

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

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

			The sequence of terms together with their prime indices begins:
   1: {}
   2: {1}
   3: {2}
   4: {1,1}
   5: {3}
   7: {4}
   9: {2,2}
  10: {1,3}
  11: {5}
  13: {6}
  14: {1,4}
  15: {2,3}
  17: {7}
  19: {8}
  20: {1,1,3}
  22: {1,5}
  23: {9}
  25: {3,3}
  26: {1,6}
  28: {1,1,4}

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

Positions of squarefree numbers in A325390.

Cf. A056239, A112798, A130091, A320348, A325324, A325327, A325362, A325364, A325366, A325368, A325388, A325405, A325407, A325460, A325461.

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

A383512 Heinz numbers of conjugate Wilf partitions.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 64, 67, 68, 69, 71, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83, 85

Offset: 1

Gus Wiseman, May 13 2025

nonn

First differs from A364347 in having 130 and lacking 110.
First differs from A381432 in lacking 65 and 133.
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.
An integer partition is Wilf iff its multiplicities are all different (ranked by A130091). It is conjugate Wilf iff its nonzero 0-appended differences are all different (ranked by A383512).

			The terms together with their prime indices begin:
     1: {}           17: {7}            35: {3,4}
     2: {1}          19: {8}            37: {12}
     3: {2}          20: {1,1,3}        38: {1,8}
     4: {1,1}        22: {1,5}          39: {2,6}
     5: {3}          23: {9}            40: {1,1,1,3}
     7: {4}          25: {3,3}          41: {13}
     8: {1,1,1}      26: {1,6}          43: {14}
     9: {2,2}        27: {2,2,2}        44: {1,1,5}
    10: {1,3}        28: {1,1,4}        45: {2,2,3}
    11: {5}          29: {10}           46: {1,9}
    13: {6}          31: {11}           47: {15}
    14: {1,4}        32: {1,1,1,1,1}    49: {4,4}
    15: {2,3}        33: {2,5}          50: {1,3,3}
    16: {1,1,1,1}    34: {1,7}          51: {2,7}

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

Partitions of this type are counted by A098859.
The conjugate version is A130091, complement A130092.
Including differences of 0 gives A325367, counted by A325324.
The strict case is A325388, counted by A320348.
The complement is A383513, counted by A336866.
Also requiring distinct multiplicities gives A383532, counted by A383507.
These are the positions of strict rows in A383534, or squarefree numbers in A383535.
A000040 lists the primes, differences A001223.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A122111 represents conjugation in terms of Heinz numbers.
A239455 counts Look-and-Say partitions, complement A351293.
A325349 counts partitions with distinct augmented differences, ranks A325366.
A383530 counts partitions that are not Wilf or conjugate Wilf, ranks A383531.
A383709 counts Wilf partitions with distinct augmented differences, ranks A383712.
Cf. A000720, A005117, A048768, A109298, A325325, A325351, A325355, A325368, A381431, A383506.

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

A383513 Heinz numbers of non conjugate Wilf partitions.

Original entry on oeis.org

6, 12, 18, 21, 24, 30, 36, 42, 48, 54, 60, 63, 65, 66, 70, 72, 78, 84, 90, 96, 102, 105, 108, 110, 114, 120, 126, 132, 133, 138, 140, 144, 147, 150, 154, 156, 162, 165, 168, 174, 180, 186, 189, 192, 198, 204, 210, 216, 220, 222, 228, 231, 234, 238, 240, 246

Offset: 1

Gus Wiseman, May 13 2025

nonn

First differs from A381433 in having 65.
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.
An integer partition is Wilf iff its multiplicities are all different (ranked by A130091). It is conjugate Wilf iff its nonzero 0-appended differences are all different (ranked by A383512).

			The terms together with their prime indices begin:
    6: {1,2}
   12: {1,1,2}
   18: {1,2,2}
   21: {2,4}
   24: {1,1,1,2}
   30: {1,2,3}
   36: {1,1,2,2}
   42: {1,2,4}
   48: {1,1,1,1,2}
   54: {1,2,2,2}
   60: {1,1,2,3}
   63: {2,2,4}
   65: {3,6}
   66: {1,2,5}
   70: {1,3,4}
   72: {1,1,1,2,2}
   78: {1,2,6}
   84: {1,1,2,4}
   90: {1,2,2,3}
   96: {1,1,1,1,1,2}

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

Partitions of this type are counted by A336866.
The conjugate version is A130092, complement A130091.
Including differences of 0 gives complement of A325367, counted by A325324.
The strict case is the complement of A325388, counted by A320348.
The complement is A383512, counted by A098859.
Also forbidding distinct multiplicities gives A383531, counted by A383530.
These are positions of non-strict rows in A383534, or nonsquarefree numbers in A383535.
A000040 lists the primes, differences A001223.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A122111 represents conjugation in terms of Heinz numbers.
A239455 counts Look-and-Say partitions, complement A351293.
A383507 counts partitions that are Wilf and conjugate Wilf, ranks A383532.
A383709 counts Wilf partitions with distinct augmented differences, ranks A383712.
Cf. A000720, A005117, A048768, A238745, A325325, A325351, A325355, A325366, A325368, A381431, A383506.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],!UnsameQ@@DeleteCases[Differences[Prepend[prix[#],0]],0]&]

A325405 Heinz numbers of integer partitions y such that the k-th differences of y are distinct for all k >= 0 and are disjoint from the i-th differences for i != k.

Original entry on oeis.org

1, 2, 3, 5, 7, 10, 11, 13, 14, 15, 17, 19, 22, 23, 26, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 46, 47, 51, 53, 55, 57, 58, 59, 61, 62, 67, 69, 71, 73, 74, 77, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 103, 106, 107, 109, 111, 113, 115, 118, 119, 122

Offset: 1

Gus Wiseman, May 02 2019

nonn

First differs from A325388 in lacking 130.
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 A325404.

			The sequence of terms together with their prime indices begins:
    1: {}
    2: {1}
    3: {2}
    5: {3}
    7: {4}
   10: {1,3}
   11: {5}
   13: {6}
   14: {1,4}
   15: {2,3}
   17: {7}
   19: {8}
   22: {1,5}
   23: {9}
   26: {1,6}
   29: {10}
   31: {11}
   33: {2,5}
   34: {1,7}
   35: {3,4}

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

A subsequence of A005117.

Cf. A056239, A112798, A279945, A325325, A325366, A325367, A325368, A325397, A325398, A325399, A325400, A325404, A325406, A325467.

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

A383709 Number of integer partitions of n with distinct multiplicities (Wilf) and distinct 0-appended differences.

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 3, 4, 4, 4, 5, 6, 5, 7, 8, 6, 8, 9, 9, 10, 9, 10, 12, 12, 11, 12, 14, 13, 14, 15, 14, 16, 16, 16, 18, 17, 17, 19, 20, 19, 19, 21, 21, 22, 22, 21, 24, 24, 23, 25, 25, 25, 26, 27, 27, 27, 28, 28, 30, 30, 28, 31, 32, 31, 32, 32, 33, 34, 34, 34

Offset: 0

Gus Wiseman, May 15 2025

nonn

Integer partitions with distinct multiplicities are called Wilf partitions.

			The a(1) = 1 through a(8) = 4 partitions:
  (1)  (2)    (3)  (4)    (5)      (6)      (7)      (8)
       (1,1)       (2,2)  (3,1,1)  (3,3)    (3,2,2)  (4,4)
                                   (4,1,1)  (3,3,1)  (3,3,2)
                                            (5,1,1)  (6,1,1)

For just distinct multiplicities we have A098859, ranks A130091, conjugate A383512.
For just distinct 0-appended differences we have A325324, ranks A325367.
For positive differences we have A383507, ranks A383532.
These partitions are ranked by A383712.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A239455 counts Look-and-Say partitions, complement A351293.
A336866 counts non Wilf partitions, ranks A130092, conjugate A383513.
A383530 counts partitions that are not Wilf or conjugate-Wilf, ranks A383531.
A383534 gives 0-prepended differences by rank, see A325351.
Cf. A047966, A320348, A325325, A325349, A325368, A325388, A381431, A383506.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@Length/@Split[#]&&UnsameQ@@Differences[Append[#,0]]&]],{n,0,30}]

Ranked by A130091 /\ A325367

A383530 Number of non Wilf and non conjugate Wilf integer partitions of n.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 3, 2, 5, 12, 14, 19, 35, 38, 55, 83, 107, 137, 209, 252, 359, 462, 612, 757, 1032, 1266, 1649, 2050, 2617, 3210, 4111, 4980, 6262, 7659, 9479, 11484, 14224, 17132, 20962, 25259, 30693, 36744, 44517, 53043, 63850, 75955, 90943, 107721, 128485

Offset: 0

Gus Wiseman, May 14 2025

nonn

An integer partition is Wilf iff its multiplicities are all different (ranked by A130091). It is conjugate Wilf iff its nonzero 0-appended differences are all different (ranked by A383512).

			The a(0) = 0 through a(9) = 12 partitions:
  .  .  .  (21)  .  .  (42)    (421)   (431)    (63)
                       (321)   (3211)  (521)    (432)
                       (2211)          (3221)   (531)
                                       (4211)   (621)
                                       (32111)  (3321)
                                                (4221)
                                                (4311)
                                                (5211)
                                                (32211)
                                                (42111)
                                                (222111)
                                                (321111)

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

Negating both sides gives A383507, ranks A383532.
These partitions are ranked by A383531.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A098859 counts Wilf partitions, ranks A130091, conjugate A383512.
A239455 counts Look-and-Say partitions, complement A351293.
A336866 counts non Wilf partitions, ranks A130092, conjugate A383513.
A381431 is the section-sum transform, union A381432, complement A381433.
A383534 gives 0-prepended differences by rank, see A325351.
A383709 counts Wilf partitions with distinct 0-appended differences, ranks A383712.
Cf. A033461, A047966, A111133, A320348, A325324, A325325, A325349, A325367, A325368, A325388, A383506.

conj[y_]:=If[Length[y]==0,y,Table[Length[Select[y,#>=k&]], {k,1,Max[y]}]];
Table[Length[Select[IntegerPartitions[n], !UnsameQ@@Length/@Split[#]&&!UnsameQ@@Length/@Split[conj[#]]&]], {n,0,30}]

These partitions have Heinz numbers A130092 /\ A383513.

A383531 Heinz numbers of integer partitions that do not have distinct multiplicities (Wilf) or distinct nonzero 0-appended differences (conjugate Wilf).

Original entry on oeis.org

6, 21, 30, 36, 42, 60, 65, 66, 70, 78, 84, 90, 102, 105, 110, 114, 120, 126, 132, 133, 138, 140, 150, 154, 156, 165, 168, 174, 180, 186, 198, 204, 210, 216, 220, 222, 228, 231, 234, 238, 240, 246, 252, 258, 264, 270, 273, 276, 280, 282, 286, 294, 300, 306, 308

Offset: 1

Gus Wiseman, May 15 2025

nonn

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.

An integer partition is Wilf iff its multiplicities are all different (ranked by A130091). It is conjugate Wilf iff its nonzero 0-appended differences are all different (ranked by A383512).

			The terms together with their prime indices begin:
    6: {1,2}
   21: {2,4}
   30: {1,2,3}
   36: {1,1,2,2}
   42: {1,2,4}
   60: {1,1,2,3}
   65: {3,6}
   66: {1,2,5}
   70: {1,3,4}
   78: {1,2,6}
   84: {1,1,2,4}
   90: {1,2,2,3}
  102: {1,2,7}
  105: {2,3,4}
  110: {1,3,5}
  114: {1,2,8}
  120: {1,1,1,2,3}

These partitions are counted by A383530.
Negating both sides gives A383532, counted by A383507.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A098859 counts Wilf partitions, ranks A130091, conjugate A383512.
A122111 represents conjugation in terms of Heinz numbers.
A325324 counts integer partitions with distinct 0-appended differences, ranks A325367.
A336866 counts non Wilf partitions, ranks A130092, conjugate A383513.
A383709 counts Wilf partitions with distinct 0-appended differences, ranks A383712.
Cf. A001223, A047966, A181819, A238745, A320348, A325325, A325349, A325366, A325368, A325388, A381431, A383506.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
conj[y_]:=If[Length[y]==0,y, Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]];
Select[Range[100],!UnsameQ@@Length/@Split[prix[#]] && !UnsameQ@@Length/@Split[conj[prix[#]]]&]

Equals A130092 /\ A383513.

A325460 Heinz numbers of integer partitions with strictly increasing differences (with the last part taken to be 0).

Original entry on oeis.org

1, 2, 3, 5, 7, 10, 11, 13, 14, 17, 19, 22, 23, 26, 29, 31, 33, 34, 37, 38, 39, 41, 43, 46, 47, 51, 53, 57, 58, 59, 61, 62, 67, 69, 71, 73, 74, 79, 82, 83, 85, 86, 87, 89, 93, 94, 95, 97, 101, 103, 106, 107, 109, 111, 113, 115, 118, 122, 123, 127, 129, 130, 131

Offset: 1

Gus Wiseman, May 03 2019

nonn

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) (with the last part taken to be 0) are (-3,-2,-1).
The enumeration of these partitions by sum is given by A179269.

			The sequence of terms together with their prime indices begins:
    1: {}
    2: {1}
    3: {2}
    5: {3}
    7: {4}
   10: {1,3}
   11: {5}
   13: {6}
   14: {1,4}
   17: {7}
   19: {8}
   22: {1,5}
   23: {9}
   26: {1,6}
   29: {10}
   31: {11}
   33: {2,5}
   34: {1,7}
   37: {12}
   38: {1,8}

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

A subsequence of A005117.

Cf. A007294, A056239, A112798, A179269, A325327, A325362, A325364, A325367, A325388, A325390, A325395, A325398, A325456, A325461.

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

A383532 Heinz numbers of integer partitions with distinct multiplicities (Wilf) and distinct nonzero 0-appended differences (conjugate Wilf).

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 20, 23, 25, 27, 28, 29, 31, 32, 37, 40, 41, 43, 44, 45, 47, 49, 50, 52, 53, 56, 59, 61, 64, 67, 68, 71, 73, 75, 76, 79, 80, 81, 83, 88, 89, 92, 97, 98, 99, 101, 103, 104, 107, 109, 112, 113, 116, 117, 121, 124, 125

Offset: 1

Gus Wiseman, May 15 2025

nonn

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.

An integer partition is Wilf iff its multiplicities are all different (ranked by A130091). It is conjugate Wilf iff its nonzero 0-appended differences are all different (ranked by A383512).

			The terms together with their prime indices begin:
    1: {}
    2: {1}
    3: {2}
    4: {1,1}
    5: {3}
    7: {4}
    8: {1,1,1}
    9: {2,2}
   11: {5}
   13: {6}
   16: {1,1,1,1}
   17: {7}
   19: {8}
   20: {1,1,3}
   23: {9}
   25: {3,3}
   27: {2,2,2}
   28: {1,1,4}
   29: {10}
   31: {11}
   32: {1,1,1,1,1}

Partitions of this type are counted by A383507.
Negating both sides gives A383531, counted by A383530.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A098859 counts Wilf partitions, ranks A130091, conjugate A383512.
A122111 represents conjugation in terms of Heinz numbers.
A325324 counts integer partitions with distinct 0-appended differences, ranks A325367.
A336866 counts non Wilf partitions, ranks A130092, conjugate A383513.
A383709 counts Wilf partitions with distinct 0-appended differences, ranks A383712.
Cf. A001223, A047966, A181819, A238745, A320348, A325325, A325349, A325366, A325368, A325388, A383506.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
paug[y_]:=-DeleteCases[Differences[Append[y,0]],0];
Select[Range[100], UnsameQ@@Last/@FactorInteger[#] && UnsameQ@@paug[Reverse[prix[#]]]&]

Equals A130091 /\ A383512.

cp's OEIS Frontend

A320348 Number of partition into distinct parts (a_1, a_2, ... , a_m) (a_1 > a_2 > ... > a_m and Sum_{k=1..m} a_k = n) such that a1 - a2, a2 - a_3, ... , a_{m-1} - a_m, a_m are different.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325367 Heinz numbers of integer partitions with distinct differences between successive parts (with the last part taken to be zero).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A383512 Heinz numbers of conjugate Wilf partitions.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A383513 Heinz numbers of non conjugate Wilf partitions.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325405 Heinz numbers of integer partitions y such that the k-th differences of y are distinct for all k >= 0 and are disjoint from the i-th differences for i != k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A383709 Number of integer partitions of n with distinct multiplicities (Wilf) and distinct 0-appended differences.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A383530 Number of non Wilf and non conjugate Wilf integer partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A383531 Heinz numbers of integer partitions that do not have distinct multiplicities (Wilf) or distinct nonzero 0-appended differences (conjugate Wilf).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs