A353866 -id:A353866 - cp's OEIS frontend

A382080 Number of ways to partition the prime indices of n into sets with a common sum.

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

Offset: 1

Gus Wiseman, Mar 20 2025

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, sum A056239.

Also the number of factorizations of n into squarefree numbers > 1 with equal sums of prime indices.

			The prime indices of 900 are {1,1,2,2,3,3}, with the following partitions into sets with a common sum:
  {{1,2,3},{1,2,3}}
  {{3},{3},{1,2},{1,2}}
So a(900) = 2.

For just sets we have A050320, distinct A050326.
Twice-partitions of this type are counted by A279788.
For just a common sum we have A321455.
MM-numbers of these multiset partitions are A326534 /\ A302478.
For distinct instead of equal sums we have A381633.
For constant instead of strict blocks we have A381995.
Positions of 0 are A381719, counted by A381994.
A000688 counts factorizations into prime powers, distinct A050361.
A001055 counts factorizations, strict A045778.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A317141 counts coarsenings of prime indices, refinements A300383.
Cf. A000720, A000961, A001222, A006171, A279784, A353866, A381635, A381871.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]& /@ sps[Range[Length[set]]]];
Table[Length[Select[mps[prix[n]], SameQ@@Total/@#&&And@@UnsameQ@@@#&]],{n,100}]

A353743 Least number with run-sum trajectory of length k; a(0) = 1.

Original entry on oeis.org

1, 2, 4, 12, 84, 1596, 84588, 11081028, 3446199708, 2477817590052, 4011586678294188, 14726534696017964148, 120183249654202605411828, 2146833388573021140471483564, 83453854313999050793547980583372, 7011542477899258250521520684673165324

Offset: 0

Gus Wiseman, Jun 11 2022

nonn

Every sequence can be uniquely split into a sequence of non-overlapping runs. For example, the runs of (2,2,1,1,1,3,2,2) are ((2,2),(1,1,1),(3),(2,2)), with sums (4,3,3,4). The run-sum trajectory is obtained by repeatedly taking the run-sum transformation (A353832, A353847) until a squarefree number is reached. For example, the trajectory 12 -> 9 -> 7 corresponds to the partitions (2,1,1) -> (2,2) -> (4).

			The terms together with their prime indices begin:
      1: {}
      2: {1}
      4: {1,1}
     12: {1,1,2}
     84: {1,1,2,4}
   1596: {1,1,2,4,8}
  84588: {1,1,2,4,8,16}

The ordered version is A072639, for run-lengths A333629.
The version for run-lengths is A325278, firsts in A182850 or A323014.
The run-sum trajectory is the iteration of A353832.
The first length-k row of A353840 has index a(k).
Other sequences pertaining to this trajectory are A353841-A353846.
A001222 counts prime factors, distinct A001221.
A056239 adds up prime indices, row sums of A112798 and A296150.
A300273 ranks collapsible partitions, counted by A275870.
A353833 ranks partitions with all equal run-sums, counted by A304442.
A353835 counts distinct run-sums of prime indices, weak A353861.
A353838 ranks partitions with all distinct run-sums, counted by A353837.
A353866 ranks rucksack partitions, counted by A353864.
Cf. A002033, A005117, A006939, A071625, A076954, A126796, A181819, A182857, A188431, A299702, A325780, A325781, A353834.

Join[{1,2},Table[2*Product[Prime[2^k],{k,0,n}],{n,0,6}]]

a(n > 1) = 2 * Product_{k=0..n-2} prime(2^k).

a(n > 0) = 2 * A325782(n).

A354580 Number of rucksack compositions of n: every distinct partial run has a different sum.

Original entry on oeis.org

1, 1, 2, 4, 6, 12, 22, 39, 68, 125, 227, 402, 710, 1280, 2281, 4040, 7196, 12780, 22623, 40136, 71121, 125863, 222616, 393305, 695059, 1227990, 2167059, 3823029, 6743268, 11889431, 20955548, 36920415, 65030404, 114519168, 201612634, 354849227

Offset: 0

Gus Wiseman, Jun 13 2022

nonn

We define a partial run of a sequence to be any contiguous constant subsequence. The term rucksack is short for run-knapsack.

			The a(0) = 1 through a(5) = 12 compositions:
  ()  (1)  (2)    (3)      (4)        (5)
           (1,1)  (1,2)    (1,3)      (1,4)
                  (2,1)    (2,2)      (2,3)
                  (1,1,1)  (3,1)      (3,2)
                           (1,2,1)    (4,1)
                           (1,1,1,1)  (1,1,3)
                                      (1,2,2)
                                      (1,3,1)
                                      (2,1,2)
                                      (2,2,1)
                                      (3,1,1)
                                      (1,1,1,1,1)

Max Alekseyev, Table of n, a(n) for n = 0..65

The knapsack version is A325676, ranked by A333223.
The non-partial version for partitions is A353837, ranked by A353838 (complement A353839).
The non-partial version is A353850, ranked by A353852.
The version for partitions is A353864, ranked by A353866.
The complete version for partitions is A353865, ranked by A353867.
These compositions are ranked by A354581.
A003242 counts anti-run compositions, ranked by A333489.
A011782 counts compositions.
A108917 counts knapsack partitions, ranked by A299702, strict A275972.
A238279 and A333755 count compositions by number of runs.
A275870 counts collapsible partitions, ranked by A300273.
A353836 counts partitions by number of distinct run-sums.
A353847 is the composition run-sum transformation.
A353851 counts compositions with all equal run-sums, ranked by A353848.
A353853-A353859 pertain to composition run-sum trajectory.
A353860 counts collapsible compositions, ranked by A354908.
Cf. A143823, A169942, A242882, A325545, A325680, A325682, A325685, A325687, A329739, A351017, A353849.

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

Terms a(16) onward from Max Alekseyev, Sep 10 2023

A353842 Last part of the trajectory of the partition run-sum transformation of n, using Heinz numbers.

Original entry on oeis.org

1, 2, 3, 3, 5, 6, 7, 5, 7, 10, 11, 7, 13, 14, 15, 7, 17, 14, 19, 15, 21, 22, 23, 15, 13, 26, 13, 21, 29, 30, 31, 11, 33, 34, 35, 21, 37, 38, 39, 13, 41, 42, 43, 33, 35, 46, 47, 21, 19, 26, 51, 39, 53, 26, 55, 35, 57, 58, 59, 35, 61, 62, 19, 13, 65, 66, 67, 51

Offset: 1

Gus Wiseman, May 25 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 run-sum trajectory is obtained by repeatedly taking the run-sum transformation (A353832) until a squarefree number is reached. For example, the trajectory 12 -> 9 -> 7 corresponds to the partitions (2,1,1) -> (2,2) -> (4).

			The partition run-sum trajectory of 87780 is: 87780 -> 65835 -> 51205 -> 19855 -> 2915, so a(87780) = 2915.

The fixed points and image are A005117.
For run-lengths instead of sums we have A304464/A304465, counted by A325268.
These are the row-ends of A353840.
Other sequences pertaining to partition trajectory are A353841-A353846.
The version for compositions is A353855, run-ends of A353853.
A001222 counts prime factors, distinct A001221.
A056239 adds up prime indices, row sums of A112798 and A296150.
A182850 and A323014 give frequency depth.
A300273 ranks collapsible partitions, counted by A275870.
A353832 represents the operation of taking run-sums of a partition.
A353833 ranks partitions with all equal run-sums, counted by A304442.
A353835 counts distinct run-sums of prime indices, weak A353861.
A353866 ranks rucksack partitions, counted by A353864.
Cf. A071625, A073093, A181819, A325239, A325277, A353834, A353838, A353847, A353865, A353867.

Table[NestWhile[Times@@Prime/@Cases[If[#==1,{},FactorInteger[#]],{p_,k_}:>PrimePi[p]*k]&,n,!SquareFreeQ[#]&],{n,100}]

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[#]&]]&]

A353845 Number of integer partitions of n such that if you repeatedly take the multiset of run-sums (or condensation), you eventually reach an empty set or singleton.

Original entry on oeis.org

1, 1, 2, 2, 4, 2, 5, 2, 8, 3, 5, 2, 15, 2, 5, 4, 18, 2, 13, 2, 14, 4, 5, 2, 62, 3, 5, 5, 14, 2, 18, 2, 48, 4, 5, 4, 71, 2, 5, 4, 54, 2, 18, 2, 14, 10, 5, 2, 374, 3, 9, 4, 14, 2, 37, 4, 54, 4, 5, 2, 131

Offset: 0

Gus Wiseman, May 26 2022

nonn

Every sequence can be uniquely split into a sequence of non-overlapping runs. For example, the runs of (2,2,1,1,1,3,2,2) are ((2,2),(1,1,1),(3),(2,2)), with sums (4,3,3,4).

			The a(1) = 1 through a(8) = 8 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (11111)  (33)      (1111111)  (44)
                    (211)            (222)                (422)
                    (1111)           (3111)               (2222)
                                     (111111)             (4211)
                                                          (41111)
                                                          (221111)
                                                          (11111111)
For example, the partition (3,2,2,2,1,1,1) has trajectory: (1,1,1,2,2,2,3) -> (3,3,6) -> (6,6) -> (12), so is counted under a(12).

Mathematics Stack Exchange, What is a sequence run? (answered 2011-12-01)

Dominated by A018818 (partitions into divisors).
The version for compositions is A353858.
A275870 counts collapsible partitions, ranked by A300273.
A304442 counts partitions with all equal run-sums, ranked by A353833.
A325268 counts partitions by omicron, rank statistic A304465.
A353832 represents the operation of taking run-sums of a partition.
A353837 counts partitions with all distinct run-sums, ranked by A353838.
A353840-A353846 pertain to partition run-sum trajectory.
A353847-A353859 pertain to composition run-sum trajectory.
A353864 counts rucksack partitions, ranked by A353866.
Cf. A000041, A008284, A181819, A225485, A325239, A325277, A325280, A326370, A353834, A353839, A353865.

Table[Length[Select[IntegerPartitions[n], Length[NestWhile[Sort[Total/@Split[#]]&,#,!UnsameQ@@#&]]<=1&]],{n,0,30}]

A354581 Numbers k such that the k-th composition in standard order is rucksack, meaning every distinct partial run has a different sum.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 28, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 44, 45, 48, 49, 50, 51, 52, 53, 54, 56, 57, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 76, 77, 80, 81, 82, 84, 85, 86, 88

Offset: 0

Gus Wiseman, Jun 15 2022

nonn

We define a partial run of a sequence to be any contiguous constant subsequence.
The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.
The term rucksack is short for run-knapsack.

			The terms together with their corresponding compositions begin:
   0: ()
   1: (1)
   2: (2)
   3: (1,1)
   4: (3)
   5: (2,1)
   6: (1,2)
   7: (1,1,1)
   8: (4)
   9: (3,1)
  10: (2,2)
  12: (1,3)
  13: (1,2,1)
  15: (1,1,1,1)
Missing are:
  11: (2,1,1)
  14: (1,1,2)
  23: (2,1,1,1)
  27: (1,2,1,1)
  29: (1,1,2,1)
  30: (1,1,1,2)
  39: (3,1,1,1)
  43: (2,2,1,1)
  46: (2,1,1,2)

The version for binary indices is A000225.
Counting distinct sums of full runs gives A353849, partitions A353835.
For partitions we have A353866, counted by A353864, complement A354583.
These compositions are counted by A354580.
Counting distinct sums of partial runs gives A354907, partitions A353861.
A066099 lists all compositions in standard order.
A124767 counts runs in standard compositions.
A124771 counts distinct contiguous subsequences, non-contiguous A334299.
A238279 and A333755 count compositions by number of runs.
A351014 counts distinct runs in standard compositions, firsts A351015.
A353838 ranks partitions with all distinct run-sums, counted by A353837.
A353851 counts compositions with all equal run-sums, ranked by A353848.
A353852 ranks compositions with all distinct run-sums, counted by A353850.
A353853-A353859 pertain to composition run-sum trajectory.
A353932 lists run-sums of standard compositions, rows ranked by A353847.
Cf. A000120, A005811, A029837, A063787, A175413, A181819, A330036, A333381, A333489, A353832, A353860.

stc[n_]:=Differences[Prepend[Join@@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Select[Range[0,100],UnsameQ@@Total/@Union@@Subsets/@Split[stc[#]]&]

A353843 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with partition run-sum trajectory ending in a partition of length k. All zeros removed.

Original entry on oeis.org

1, 1, 2, 2, 1, 4, 1, 2, 5, 5, 5, 1, 2, 12, 1, 8, 11, 3, 3, 19, 8, 5, 27, 9, 1, 2, 34, 19, 1, 15, 26, 34, 2, 2, 49, 45, 5, 5, 68, 48, 14, 4, 58, 98, 15, 1, 18, 76, 105, 31, 1, 2, 88, 159, 46, 2, 13, 98, 191, 79, 4, 2, 114, 261, 105, 8, 14, 148, 282, 164, 19

Offset: 0

Gus Wiseman, Jun 04 2022

The partition run-sum trajectory is obtained by repeatedly taking the run-sums until a strict partition is reached. For example, the trajectory of y = (3,2,1,1,1) is (3,2,1,1,1) -> (3,3,2) -> (6,2), so y is counted under T(8,2).

			Triangle begins:
   1
   1
   2
   2  1
   4  1
   2  5
   5  5  1
   2 12  1
   8 11  3
   3 19  8
   5 27  9  1
   2 34 19  1
  15 26 34  2
   2 49 45  5
   5 68 48 14
   4 58 98 15  1
For example, row n = 8 counts the following partitions:
  (8)         (53)       (431)
  (44)        (62)       (521)
  (422)       (71)       (3221)
  (2222)      (332)
  (4211)      (611)
  (41111)     (3311)
  (221111)    (5111)
  (11111111)  (22211)
              (32111)
              (311111)
              (2111111)

Row sums are A000041.
Row-lengths are A003056.
The last part of the same trajectory is A353842.
Column k = 1 is A353845, compositions A353858.
The length of the trajectory is A353846.
The version for compositions is A353856.
A275870 counts collapsible partitions, ranked by A300273.
A304442 counts partitions with constant run-sums, ranked by A353833/A353834.
A325268 counts partitions by omicron, rank statistic A304465.
A353837 counts partitions with all distinct run-sums, ranked by A353838.
A353840-A353846 pertain to partition run-sum trajectory.
A353847 represents the run-sums of a composition, partitions A353832.
A353864 counts rucksack partitions, ranked by A353866.
A353865 counts perfect rucksack partitions, ranked by A353867.
A353932 lists run-sums of standard compositions.
Cf. A008284, A116608, A325242, A325268, A225485 or A325280.
Cf. A047966, A237685, A325277, A353841, A353853-A353859.

Table[Length[Select[IntegerPartitions[n], Length[FixedPoint[Sort[Total/@Split[#]]&,#]]==k&]],{n,0,15},{k,0,n}]

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]&]

A383309 Numbers whose prime indices are prime powers > 1 with a common sum of prime indices.

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 17, 19, 23, 25, 27, 31, 35, 41, 49, 53, 59, 67, 81, 83, 97, 103, 109, 121, 125, 127, 131, 157, 175, 179, 191, 209, 211, 227, 241, 243, 245, 277, 283, 289, 311, 331, 343, 353, 361, 367, 391, 401, 419, 431, 461, 509, 529, 547, 563, 587, 599

Offset: 1

Gus Wiseman, Apr 25 2025

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. We define the multiset of multisets with MM-number n to be formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

			The systems with these MM-numbers begin:
   1: {}
   3: {{1}}
   5: {{2}}
   7: {{1,1}}
   9: {{1},{1}}
  11: {{3}}
  17: {{4}}
  19: {{1,1,1}}
  23: {{2,2}}
  25: {{2},{2}}
  27: {{1},{1},{1}}
  31: {{5}}
  35: {{2},{1,1}}
  41: {{6}}
  49: {{1,1},{1,1}}
  53: {{1,1,1,1}}
  59: {{7}}
  67: {{8}}
  81: {{1},{1},{1},{1}}
  83: {{9}}
  97: {{3,3}}

Twice-partitions of this type are counted by A279789.
For just a common sum we have A326534.
For just constant blocks we have A355743.
Numbers without a factorization of this type are listed by A381871, counted by A381993.
The multiplicative version is A381995.
This is the odd case of A382215.
For strict instead of constant blocks we have A382304.
A001055 counts factorizations, strict A045778.
A023894 counts partitions into prime-powers.
A034699 gives maximal prime-power divisor.
A050361 counts factorizations into distinct prime powers.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798.
A246655 lists the prime-powers (A000961 includes 1), towers A164336.
A317141 counts coarsenings of prime indices, refinements A300383.
A353864 counts rucksack partitions, ranked by A353866.
A355742 chooses a prime-power divisor of each prime index.
Cf. A000688, A000720, A001222, A006171, A038041, A279784, A302242, A302493, A321455, A326518, A381719.

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

Equals A326534 /\ A355743.

cp's OEIS Frontend

A382080 Number of ways to partition the prime indices of n into sets with a common sum.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A353743 Least number with run-sum trajectory of length k; a(0) = 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A354580 Number of rucksack compositions of n: every distinct partial run has a different sum.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A353842 Last part of the trajectory of the partition run-sum transformation of n, using Heinz numbers.

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

A353845 Number of integer partitions of n such that if you repeatedly take the multiset of run-sums (or condensation), you eventually reach an empty set or singleton.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A354581 Numbers k such that the k-th composition in standard order is rucksack, meaning every distinct partial run has a different sum.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A353843 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with partition run-sum trajectory ending in a partition of length k. All zeros removed.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author