|
|
A356231
|
|
Heinz number of the sequence (A356226) of lengths of maximal gapless submultisets of the prime indices of n.
|
|
15
|
|
|
1, 2, 2, 3, 2, 3, 2, 5, 3, 4, 2, 5, 2, 4, 3, 7, 2, 5, 2, 6, 4, 4, 2, 7, 3, 4, 5, 6, 2, 5, 2, 11, 4, 4, 3, 7, 2, 4, 4, 10, 2, 6, 2, 6, 5, 4, 2, 11, 3, 6, 4, 6, 2, 7, 4, 10, 4, 4, 2, 7, 2, 4, 6, 13, 4, 6, 2, 6, 4, 6, 2, 11, 2, 4, 5, 6, 3, 6, 2, 14, 7, 4, 2, 10
(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.
A multiset is gapless if it covers an unbroken interval of positive integers. For example, the multiset {2,3,5,5,6,9} has three maximal gapless submultisets: {2,3}, {5,5,6}, {9}.
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.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The prime indices of 18564 are {1,1,2,4,6,7}, with maximal gapless submultisets {1,1,2}, {4}, {6,7}. These have lengths (3,1,2), with Heinz number 30, so a(18564) = 30.
|
|
MATHEMATICA
|
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
Table[Times@@Prime/@Length/@Split[primeMS[n], #1>=#2-1&], {n, 100}]
|
|
CROSSREFS
|
These are the Heinz numbers of the rows of A356226.
A003963 multiplies together the prime indices.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|