|
|
A353399
|
|
Numbers whose product of prime exponents equals the product of prime shadows of its prime indices.
|
|
14
|
|
|
1, 2, 12, 20, 36, 44, 56, 68, 100, 124, 164, 184, 208, 236, 240, 268, 332, 436, 464, 484, 508, 528, 608, 628, 688, 716, 720, 752, 764, 776, 816, 844, 880, 964, 1108, 1132, 1156, 1168, 1200, 1264, 1296, 1324, 1344, 1360, 1412, 1468, 1488, 1584, 1604, 1616, 1724
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
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 the prime shadow A181819(n) to be the product of primes indexed by the exponents in the prime factorization of n. For example, 90 = prime(1)*prime(2)^2*prime(3) has prime shadow prime(1)*prime(2)*prime(1) = 12.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The terms together with their prime indices begin:
1: {}
2: {1}
12: {1,1,2}
20: {1,1,3}
36: {1,1,2,2}
44: {1,1,5}
56: {1,1,1,4}
68: {1,1,7}
100: {1,1,3,3}
124: {1,1,11}
164: {1,1,13}
184: {1,1,1,9}
208: {1,1,1,1,6}
236: {1,1,17}
240: {1,1,1,1,2,3}
|
|
MATHEMATICA
|
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
red[n_]:=If[n==1, 1, Times@@Prime/@Last/@FactorInteger[n]];
Select[Range[100], Times@@red/@primeMS[#]==Times@@Last/@FactorInteger[#]&]
|
|
CROSSREFS
|
The partitions are counted by A353398.
Taking indices instead of exponents on the LHS gives A353503.
A130091 lists numbers with distinct prime exponents, counted by A098859.
A325131 lists numbers relatively prime to their prime shadow.
Numbers divisible by their prime shadow:
- nonprime recursive version A353389
- recursive version counted by A353426
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|