A182857 -id:A182857 - cp's OEIS frontend

A319160 Number of integer partitions of n whose multiplicities appear with relatively prime multiplicities.

1, 2, 2, 4, 5, 7, 11, 16, 22, 31, 45, 58, 83, 108, 142, 188, 250, 315, 417, 528, 674, 861, 1094, 1363, 1724, 2152, 2670, 3311, 4105, 5021, 6193, 7561, 9216, 11219, 13614, 16419, 19886, 23920, 28733, 34438, 41272, 49184, 58746, 69823, 82948, 98380, 116567

Offset: 1

Gus Wiseman, Sep 12 2018

nonn

From Gus Wiseman, Jul 11 2023: (Start)
A partition is aperiodic (A000837) if its multiplicities are relatively prime. This sequence counts partitions whose multiplicities are aperiodic.
For example:
- The multiplicities of (5,3) are (1,1), with multiplicities (2), with common divisor 2, so it is not counted under a(8).
- The multiplicities of (3,2,2,1) are (2,1,1), with multiplicities (2,1), which are relatively prime, so it is counted under a(8).
- The multiplicities of (3,3,1,1) are (2,2), with multiplicities (2), with common divisor 2, so it is not counted under a(8).
- The multiplicities of (4,4,4,3,3,3,2,1) are (3,3,1,1), with multiplicities (2,2), which have common divisor 2, so it is not counted under a(24).
(End)

			The a(8) = 16 partitions:
  (8),
  (44),
  (332), (422), (611),
  (2222), (3221), (4211), (5111),
  (22211), (32111), (41111),
  (221111), (311111),
  (2111111),
  (11111111).
Missing from this list are: (53), (62), (71), (431), (521), (3311).

These partitions have ranks A319161.
For distinct instead of relatively prime multiplicities we have A325329.
Cf. A000837, A001597, A007916, A047966, A071625, A098859, A100953, A181819, A182850, A182857, A305563, A319149, A319162, A319164.

Table[Length[Select[IntegerPartitions[n], GCD@@Length/@Split[Sort[Length/@Split[#]]]==1&]],{n,30}]

A325283 Heinz numbers of integer partitions with maximum adjusted frequency depth for partitions of that sum.

Original entry on oeis.org

2, 4, 6, 12, 18, 20, 24, 28, 40, 48, 60, 84, 90, 120, 126, 132, 140, 150, 156, 168, 180, 198, 204, 220, 228, 234, 240, 252, 260, 264, 270, 276, 280

Offset: 1

Gus Wiseman, Apr 17 2019

The enumeration of these partitions by sum is given by A325254.
The adjusted frequency depth of an integer partition is 0 if the partition is empty, and otherwise it is 1 plus the number of times one must take the multiset of multiplicities to reach a singleton. For example, the partition (32211) has adjusted frequency depth 5 because we have: (32211) -> (221) -> (21) -> (11) -> (2).
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The sequence of terms together with their prime indices and their omega-sequences (see A323023) begins:
  2:   {1}         (1)
  4:   {1,1}       (2,1)
  6:   {1,2}       (2,2,1)
  12:  {1,1,2}     (3,2,2,1)
  18:  {1,2,2}     (3,2,2,1)
  20:  {1,1,3}     (3,2,2,1)
  24:  {1,1,1,2}   (4,2,2,1)
  28:  {1,1,4}     (3,2,2,1)
  40:  {1,1,1,3}   (4,2,2,1)
  48:  {1,1,1,1,2} (5,2,2,1)
  60:  {1,1,2,3}   (4,3,2,2,1)
  84:  {1,1,2,4}   (4,3,2,2,1)
  90:  {1,2,2,3}   (4,3,2,2,1)
  120: {1,1,1,2,3} (5,3,2,2,1)
  126: {1,2,2,4}   (4,3,2,2,1)
  132: {1,1,2,5}   (4,3,2,2,1)
  140: {1,1,3,4}   (4,3,2,2,1)
  150: {1,2,3,3}   (4,3,2,2,1)
  156: {1,1,2,6}   (4,3,2,2,1)
  168: {1,1,1,2,4} (5,3,2,2,1)
  180: {1,1,2,2,3} (5,3,2,2,1)

Cf. A011784, A056239, A112798, A118914, A181819, A182857, A225486, A323014, A323023, A325254, A325258, A325277, A325278, A325282.

Integer partition triangles: A008284 (first omega), A116608 (second omega), A325242 (third omega), A325268 (second-to-last omega), A225485 or A325280 (length/frequency depth).

nn=30;
primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
fdadj[ptn_List]:=If[ptn=={},0,Length[NestWhileList[Sort[Length/@Split[#]]&,ptn,Length[#]>1&]]];
mfds=Table[Max@@fdadj/@IntegerPartitions[n],{n,nn}];
Select[Range[Prime[nn]],fdadj[primeMS[#]]==mfds[[Total[primeMS[#]]]]&]

A353844 Starting with the multiset of prime indices of n, repeatedly take the multiset of run-sums until you reach a squarefree number. This number is prime (or 1) iff n belongs to the sequence.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 40, 41, 43, 47, 49, 53, 59, 61, 63, 64, 67, 71, 73, 79, 81, 83, 84, 89, 97, 101, 103, 107, 109, 112, 113, 121, 125, 127, 128, 131, 137, 139, 144, 149, 151, 157, 163, 167, 169, 173, 179

Offset: 1

Gus Wiseman, May 26 2022

nonn

The run-sums transformation is described by Kimberling at A237685 and A237750.
The runs of a sequence are its maximal consecutive constant subsequences. For example, the runs of {1,1,1,2,2,3,4} are {1,1,1}, {2,2}, {3}, {4}, with sums {3,3,4,4}.
Note that the Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so this sequence lists Heinz numbers of partitions whose run-sum trajectory reaches an empty set or singleton.

			The terms together with their prime indices begin:
      1: {}            25: {3,3}           64: {1,1,1,1,1,1}
      2: {1}           27: {2,2,2}         67: {19}
      3: {2}           29: {10}            71: {20}
      4: {1,1}         31: {11}            73: {21}
      5: {3}           32: {1,1,1,1,1}     79: {22}
      7: {4}           37: {12}            81: {2,2,2,2}
      8: {1,1,1}       40: {1,1,1,3}       83: {23}
      9: {2,2}         41: {13}            84: {1,1,2,4}
     11: {5}           43: {14}            89: {24}
     12: {1,1,2}       47: {15}            97: {25}
     13: {6}           49: {4,4}          101: {26}
     16: {1,1,1,1}     53: {16}           103: {27}
     17: {7}           59: {17}           107: {28}
     19: {8}           61: {18}           109: {29}
     23: {9}           63: {2,2,4}        112: {1,1,1,1,4}
The trajectory 60 -> 45 -> 35 ends in a nonprime number 35, so 60 is not in the sequence.
The trajectory 84 -> 63 -> 49 -> 19 ends in a prime number 19, so 84 is in the sequence.

This sequence is a subset of A300273, counted by A275870.
The version for compositions is A353857, counted by A353847.
A001222 counts prime factors, distinct A001221.
A056239 adds up prime indices, row sums of A112798 and A296150.
A124010 gives prime signature, sorted A118914.
A304442 counts partitions with all equal run-sums.
A353851 counts compositions with all equal run-sums, ranked by A353848.
A325268 counts partitions by omicron, rank statistic A304465.
A353832 represents the operation of taking run-sums of a partition.
A353833 ranks partitions with all equal run-sums, nonprime A353834.
A353835 counts distinct run-sums of prime indices, weak A353861.
A353838 ranks partitions with all distinct run-sums, counted by A353837.
A353840-A353846 pertain to partition run-sum trajectory.
A353853-A353859 pertain to composition run-sum trajectory.
A353866 ranks rucksack partitions, counted by A353864.
Cf. A005811, A073093, A130091, A181819, A182857, A304660, A325239, A325277, A353839, A353862, A353867.

ope[n_]:=Times@@Prime/@Cases[If[n==1,{},FactorInteger[n]],{p_,k_}:>PrimePi[p]*k];
Select[Range[100],#==1||PrimeQ[NestWhile[ope,#,!SquareFreeQ[#]&]]&]

A305731 Number of irreducible integer partitions of n.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 4, 0, 6, 3, 12, 0, 21, 1, 30, 19, 43, 10, 82, 20, 103, 68, 152, 58, 236, 102, 301, 196, 413, 205, 653, 310, 788, 580, 1115, 718, 1649, 1006, 2149, 1714, 3018, 2247, 4502, 3389, 6036, 5509, 8647, 7601, 12678, 11310, 17541

Offset: 0

Gus Wiseman, Jun 22 2018

nonn

A multiset m whose distinct elements are m_1, m_2, ..., m_k with multiplicities y_1, y_2, ..., y_k is irreducible if m is of size > 1 and either gcd(m_1, ..., m_k) > 1 or the multiset {y_1, ..., y_k} is irreducible.

			The a(6) = 4 irreducible partitions are (42), (33), (222), (2211).

Cf. A100953, A181819, A182850, A182857, A275870, A304818, A305563, A305733, A305735.

ptnredQ[y_]:=Or[Length[y]==1,And[GCD@@y==1,ptnredQ[Sort[Length/@Split[y],Greater]]]];
Table[Length[Select[IntegerPartitions[n],!ptnredQ[#]&]],{n,20}]

A304647 Smallest term of A304636 that requires exactly n iterations to reach a fixed point under the x -> A181819(x) map.

Original entry on oeis.org

5, 8, 30, 360, 1801800, 2746644314348614680000, 13268350773236509446586539974366689358164301703214270074935844483572035447570761114173070859428708074413696096366645684575600000000

Offset: 0

Gus Wiseman, May 15 2018

nonn

The first entry 5 is optional so has offset 0.

			The list of multisets with Heinz numbers in the sequence is the following. The number of k's in row n + 1 is equal to the k-th largest term of row n.
                     5: {3}
                     8: {1,1,1}
                    30: {1,2,3}
                   360: {1,1,1,2,2,3}
               1801800: {1,1,1,2,2,3,3,4,5,6}
2746644314348614680000: {1,1,1,1,1,1,2,2,2,2,2,3,3,3,3,4,4,4,5,5,5,6,6,7,7,8,9,10}

Cf. A001221, A001222, A001462, A012257, A014612, A033992, A071625, A112798, A181819, A182850, A182857, A275870, A304464, A304465, A304634, A304636.

Function[m,Times@@Prime/@m]/@NestList[Join@@Table[Table[i,{Reverse[#][[i]]}],{i,Length[#]}]&,{3},6]

A325757 Irregular triangle read by rows giving the frequency span of n.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, May 19 2019

We define the frequency span of an integer partition to be the partition itself if it has no or only one block, and otherwise it is the multiset union of the partition and the frequency span of its multiplicities. For example, the frequency span of (3,2,2,1) is {1,2,2,3} U {1,1,2} U {1,2} U {1,1} U {2} = {1,1,1,1,1,1,2,2,2,2,2,3}. The frequency span of a positive integer is the frequency span of its prime indices (row n of A296150).

			Triangle begins:
   1:
   2: 1
   3: 2
   4: 1 1 2
   5: 3
   6: 1 1 1 2 2
   7: 4
   8: 1 1 1 3
   9: 2 2 2
  10: 1 1 1 2 3
  11: 5
  12: 1 1 1 1 1 2 2 2
  13: 6
  14: 1 1 1 2 4
  15: 1 1 2 2 3
  16: 1 1 1 1 4
  17: 7
  18: 1 1 1 1 2 2 2 2
  19: 8
  20: 1 1 1 1 1 2 2 3
  21: 1 1 2 2 4
  22: 1 1 1 2 5
  23: 9
  24: 1 1 1 1 1 1 2 2 3
  25: 2 3 3
  26: 1 1 1 2 6
  27: 2 2 2 3
  28: 1 1 1 1 1 2 2 4

Row lengths are A325249.
Run-lengths are A325758.
Number of distinct terms in row n is A325759(n).
Cf. A001221, A001222, A056239, A071625, A112798, A181819, A182857, A290822, A323014, A324843, A325277, A325755, A325760.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
freqspan[ptn_]:=If[Length[ptn]<=1,ptn,Sort[Join[ptn,freqspan[Sort[Length/@Split[ptn]]]]]];
Table[freqspan[primeMS[n]],{n,15}]

A325758 Irregular triangle read by rows giving the frequency span signature of n.

Original entry on oeis.org

1, 1, 2, 1, 1, 3, 2, 1, 3, 1, 3, 3, 1, 1, 1, 5, 3, 1, 3, 1, 1, 2, 2, 1, 4, 1, 1, 4, 4, 1, 5, 2, 1, 2, 2, 1, 3, 1, 1, 1, 6, 2, 1, 1, 2, 3, 1, 1, 3, 1, 5, 2, 1, 1, 4, 1, 2, 1, 5, 1, 2, 2, 1, 3, 1, 1, 2, 1, 1, 1, 2, 5, 1, 3, 1, 1, 2, 2, 1, 6, 1, 2, 1, 4, 1, 1, 1

Offset: 1

Gus Wiseman, May 19 2019

We define the frequency span of an integer partition to be the partition itself if it has no or only one block, and otherwise it is the multiset union of the partition and the frequency span of its multiplicities. For example, the frequency span of (3,2,2,1) is {1,2,2,3} U {1,1,2} U {1,2} U {1,1} U {2} = {1,1,1,1,1,1,2,2,2,2,2,3}. The frequency span of a positive integer is the frequency span of its prime indices (row n of A296150). Row n of this triangle gives an unsorted list of the multiplicities in the frequency span of n. For example, the frequency span of 30 is {1,1,1,1,2,3,3}, so row 30 is (4,1,2).

			Triangle begins:
  1
  1
  2 1
  1
  3 2
  1
  3 1
  3
  3 1 1
  1
  5 3
  1
  3 1 1
  2 2 1
  4 1
  1
  4 4
  1
  5 2 1
  2 2 1
  3 1 1
  1
  6 2 1
  1 2
  3 1 1
  3 1
  5 2 1
  1
  4 1 2

Row sums are A325249.
Row lengths are A325759.
Run-lengths of A325757.
Row n is the unsorted prime signature of A325760(n).
Cf. A001221, A001222, A056239, A071625, A112798, A181819, A182857, A290822, A323014,A325277.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
freqspan[ptn_]:=If[Length[ptn]<=1,ptn,Sort[Join[ptn,freqspan[Sort[Length/@Split[ptn]]]]]];
Table[Length/@Split[freqspan[primeMS[n]]],{n,30}]

A325759 Number of distinct frequencies in the frequency span of n.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, May 19 2019

nonn

We define the frequency span of an integer partition to be the partition itself if it has no or only one block, and otherwise it is the multiset union of the partition and the frequency span of its multiplicities. For example, the frequency span of (3,2,2,1) is {1,2,2,3} U {1,1,2} U {1,2} U {1,1} U {2} = {1,1,1,1,1,1,2,2,2,2,2,3}. The frequency span of a positive integer n is the frequency span of its prime indices (row n of A296150).

Row lengths of A325758.
Number of distinct entries in row n of A325757.
Cf. A001221, A001222, A056239, A071625, A112798, A181819, A182857, A323014, A325249, A325277, A325760.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
freqspan[ptn_]:=If[Length[ptn]<=1,ptn,Sort[Join[ptn,freqspan[Sort[Length/@Split[ptn]]]]]];
Table[Length[Union[freqspan[primeMS[n]]]],{n,100}]

A325760 Heinz number of the frequency span of n.

Original entry on oeis.org

1, 2, 3, 12, 5, 72, 7, 40, 27, 120, 11, 864, 13, 168, 180, 112, 17, 1296, 19, 1440, 252, 264, 23, 2880, 75, 312, 135, 2016, 29, 1200, 31, 352, 396, 408, 420, 972, 37, 456, 468, 4800, 41, 1680, 43, 3168, 3240, 552, 47, 8064, 147, 3600, 612, 3744, 53, 6480, 660

Offset: 1

Gus Wiseman, May 19 2019

nonn

The Heinz number of a positive integer sequence (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

We define the frequency span of an integer partition to be the partition itself if it has no or only one block, and otherwise it is the multiset union of the partition and the frequency span of its multiplicities. For example, the frequency span of (3,2,2,1) is {1,2,2,3} U {1,1,2} U {1,2} U {1,1} U {2} = {1,1,1,1,1,1,2,2,2,2,2,3}. The frequency span of a positive integer n is the frequency span of its prime indices (row n of A296150).

Row-products of A325277.
The prime indices of a(n) are row n of A325757.
The unsorted prime signature of a(n) is row n of A325758.
Cf. A001221, A001222, A056239, A071625, A112798, A181819, A182857, A323014, A324843, A325248, A325249, A325759.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
freqspan[ptn_]:=If[Length[ptn]<=1,ptn,Sort[Join[ptn,freqspan[Sort[Length/@Split[ptn]]]]]];
Table[Times@@Prime/@freqspan[primeMS[n]],{n,30}]

A354583 Heinz numbers of non-rucksack partitions: not every prime-power divisor has a different sum of prime indices.

Original entry on oeis.org

12, 24, 36, 40, 48, 60, 63, 72, 80, 84, 96, 108, 112, 120, 126, 132, 144, 156, 160, 168, 180, 189, 192, 200, 204, 216, 224, 228, 240, 252, 264, 276, 280, 288, 300, 312, 315, 320, 324, 325, 336, 348, 351, 352, 360, 372, 378, 384, 396, 400, 408, 420, 432, 440

Offset: 1

Gus Wiseman, Jun 15 2022

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.

The term rucksack is short for run-knapsack.

			The terms together with their prime indices begin:
   12: {1,1,2}
   24: {1,1,1,2}
   36: {1,1,2,2}
   40: {1,1,1,3}
   48: {1,1,1,1,2}
   60: {1,1,2,3}
   63: {2,2,4}
   72: {1,1,1,2,2}
   80: {1,1,1,1,3}
   84: {1,1,2,4}
   96: {1,1,1,1,1,2}
  108: {1,1,2,2,2}
  112: {1,1,1,1,4}
  120: {1,1,1,2,3}
  126: {1,2,2,4}
  132: {1,1,2,5}
  144: {1,1,1,1,2,2}
  156: {1,1,2,6}
  160: {1,1,1,1,1,3}
  168: {1,1,1,2,4}
For example, {2,2,2,3,3} does not have distinct run-sums because 2+2+2 = 3+3, so 675 is in the sequence.

Knapsack partitions are counted by A108917, ranked by A299702.
Non-knapsack partitions are ranked by A299729.
The non-partial version is A353839, complement A353838 (counted by A353837).
The complement is A353866, counted by A353864.
The complete complement is A353867, counted by A353865.
The complement for compositions is counted by A354580.
A001222 counts prime factors, distinct A001221.
A056239 adds up prime indices, row sums of A112798 and A296150.
A073093 counts prime-power divisors.
A300273 ranks collapsible partitions, counted by A275870.
A304442 counts partitions with all equal run-sums, ranked by A353833.
A333223 ranks knapsack compositions, counted by A325676.
A353852 ranks compositions with all distinct run-sums, counted by A353850.
A353861 counts distinct partial run-sums of prime indices.
A354584 lists run-sums of prime indices, rows ranked by A353832.
Cf. A005811, A118914, A124010, A175413, A181819, A182857, A316413, A325862, A353834, A353835, A353836, A353931.

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

cp's OEIS Frontend

A319160 Number of integer partitions of n whose multiplicities appear with relatively prime multiplicities.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325283 Heinz numbers of integer partitions with maximum adjusted frequency depth for partitions of that sum.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A353844 Starting with the multiset of prime indices of n, repeatedly take the multiset of run-sums until you reach a squarefree number. This number is prime (or 1) iff n belongs to the sequence.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A305731 Number of irreducible integer partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A304647 Smallest term of A304636 that requires exactly n iterations to reach a fixed point under the x -> A181819(x) map.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325757 Irregular triangle read by rows giving the frequency span of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325758 Irregular triangle read by rows giving the frequency span signature of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325759 Number of distinct frequencies in the frequency span of n.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A325760 Heinz number of the frequency span of n.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica