|
| |
|
|
A364192
|
|
High (i.e., greatest) co-mode in the multiset of prime indices of n.
|
|
5
|
|
|
|
0, 1, 2, 1, 3, 2, 4, 1, 2, 3, 5, 2, 6, 4, 3, 1, 7, 1, 8, 3, 4, 5, 9, 2, 3, 6, 2, 4, 10, 3, 11, 1, 5, 7, 4, 2, 12, 8, 6, 3, 13, 4, 14, 5, 3, 9, 15, 2, 4, 1, 7, 6, 16, 1, 5, 4, 8, 10, 17, 3, 18, 11, 4, 1, 6, 5, 19, 7, 9, 4, 20, 2, 21, 12, 2, 8, 5, 6, 22, 3, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
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.
We define a co-mode in a multiset to be an element that appears at most as many times as each of the others. For example, the co-modes in {a,a,b,b,b,c,c} are {a,c}.
Extending the terminology of A124943, the "high co-mode" in a multiset is the greatest co-mode.
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
EXAMPLE
|
The prime indices of 2100 are {1,1,2,3,3,4}, with co-modes {2,4}, so a(2100) = 4.
|
|
|
MATHEMATICA
|
prix[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
comodes[ms_]:=Select[Union[ms], Count[ms, #]<=Min@@Length/@Split[ms]&];
Table[If[n==1, 0, Max[comodes[prix[n]]]], {n, 30}]
|
|
|
CROSSREFS
|
Ranking and counting partitions:
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
