|
|
A353866
|
|
Heinz numbers of rucksack partitions. Every prime-power divisor has a different sum of prime indices.
|
|
27
|
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
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.
In a knapsack partition (A108917, ranked by A299702), every submultiset has a different sum, so these are run-knapsack partitions or rucksack partitions for short.
|
|
LINKS
|
|
|
EXAMPLE
|
The terms together with their prime indices begin:
1: {}
2: {1}
3: {2}
4: {1,1}
5: {3}
6: {1,2}
7: {4}
8: {1,1,1}
9: {2,2}
10: {1,3}
11: {5}
13: {6}
14: {1,4}
15: {2,3}
16: {1,1,1,1}
The sequence contains 18 because its prime-power divisors {1,2,3,9} have prime indices {}, {1}, {2}, {2,2} with distinct sums {0,1,2,4}. On the other hand, 12 is not in the sequence because {2} and {1,1} have the same sum.
|
|
MATHEMATICA
|
msubs[s_]:=Join@@@Tuples[Table[Take[t, i], {t, Split[s]}, {i, 0, Length[t]}]];
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
Select[Range[100], UnsameQ@@Total/@Select[msubs[primeMS[#]], SameQ@@#&]&]
|
|
CROSSREFS
|
These partitions are counted by A353864.
A073093 counts prime-power divisors.
A353832 represents the operation of taking run-sums of a partition.
A353836 counts partitions by number of distinct run-sums.
A353852 ranks compositions with all distinct run-sums, counted by A353850.
A353863 counts partitions whose weak run-sums cover an initial interval.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|