A381637 Number of multisets that can be obtained by taking the sum of each block of a multiset partition of the prime indices of n into blocks with distinct sums.

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

Offset: 1

Author

Gus Wiseman, Mar 10 2025

Keywords

• nonn

Comments

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.

Examples

			The prime indices of 84 are {1,1,2,4}, with 7 multiset partitions into blocks with distinct sums:
  {{1,1,2,4}}
  {{1},{1,2,4}}
  {{2},{1,1,4}}
  {{1,1},{2,4}}
  {{1,2},{1,4}}
  {{1},{2},{1,4}}
  {{1},{4},{1,2}}
with block-sums: {8}, {1,7}, {2,6}, {2,6}, {3,5}, {1,2,5}, {1,3,4}, of which 6 are distinct, so a(84) = 6.
		

Crossrefs

Allowing any block-sums gives A317141 (lower A300383), before sums A001055.

Before taking sums we had A321469.

For distinct blocks instead of distinct block-sums we have A381452.

If each block is a set we have A381634 (zeros A381806), before sums A381633.

For equal instead of distinct block-sums we have A381872, before sums A321455.

Other multiset partitions of prime indices:

- For multisets of constant multisets (A000688) see A381455 (upper), A381453 (lower).

- For set multipartitions (A050320) see A381078 (upper), A381454 (lower).

- For sets of constant multisets (A050361) see A381715.

- For sets of constant multisets with distinct sums (A381635) see A381716, A381636.

A003963 gives product of prime indices.

A055396 gives least prime index, greatest A061395.

A056239 adds up prime indices, row sums of A112798.

A265947 counts refinement-ordered pairs of integer partitions.

Cf. A000720, A001222, A001970, A002846, A045778, A066328, A213385, A299200, A299201, A299202, A300385, A317142.

Programs

Mathematica

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[mset_]:=Union[Sort[Sort/@(#/.x_Integer:>mset[[x]])]&/@sps[Range[Length[mset]]]];
Table[Length[Union[Sort[Total/@#]&/@Select[mps[prix[n]],UnsameQ@@Total/@#&]]],{n,100}]