OFFSET
1,2
COMMENTS
We define the multiset multiplicity kernel (MMK) of a positive integer n to be the product of (least prime factor with exponent k)^(number of prime factors with exponent k) over all distinct exponents k appearing in the prime factorization of n. For example, 90 has prime factorization 2^1 * 3^2 * 5^1, so for k = 1 we have 2^2, and for k = 2 we have 3^1, so MMK(90) = 12. As an operation on multisets, MMK is represented by the triangle A367579, and as an operation on their ranks it is represented by A367580.
FORMULA
a(p) = p for all primes p.
EXAMPLE
The least number with multiset multiplicity kernel 9 is 15, so a(9) = 15.
The terms together with their prime indices begin:
1 -> 1: {}
2 -> 2: {1}
3 -> 3: {2}
4 -> 6: {1,2}
5 -> 5: {3}
6 -> 12: {1,1,2}
7 -> 7: {4}
8 -> 30: {1,2,3}
9 -> 15: {2,3}
10 -> 20: {1,1,3}
11 -> 11: {5}
12 -> 90: {1,2,2,3}
13 -> 13: {6}
14 -> 28: {1,1,4}
15 -> 45: {2,2,3}
16 ->210: {1,2,3,4}
MATHEMATICA
nn=1000;
mmk[q_]:=With[{mts=Length/@Split[q]}, Sort[Table[Min@@Select[q, Count[q, #]==i&], {i, mts}]]];
spnm[y_]:=Max@@NestWhile[Most, Sort[y], Union[#]!=Range[Max@@#]&];
qq=Table[Times@@mmk[Join@@ConstantArray@@@FactorInteger[n]], {n, nn}];
Table[Position[qq, i][[1, 1]], {i, spnm[qq]}]
CROSSREFS
Positions of primes are A000040.
Positions of squarefree numbers are A000961.
All terms are rootless A007916.
Contains no nonprime prime powers A246547.
Positions of first appearances in A367580.
The sorted version is A367585.
The complement is A367768.
A007947 gives squarefree kernel.
A071625 counts distinct prime exponents.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Nov 29 2023
STATUS
approved