OFFSET
1,1
COMMENTS
All Achilles numbers in A393816 (with just 2 distinct prime factors) have prime exponents that pairwise indivisible.
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
EXAMPLE
Table of n, a(n) for select n:
n a(n)
--------------------------------------------------------------------------
1 s(20) = t(1) = 1800 = 2^3 * 3^2 * 5^2
2 s(25) = t(2) = 2700 = 2^2 * 3^3 * 5^2
3 s(31) = t(3) = 3528 = 2^3 * 3^2 * 7^2
4 s(36) = t(4) = 4500 = 2^2 * 3^2 * 5^3
5 s(40) = t(5) = 5292 = 2^2 * 3^3 * 7^2
19 s(100) = q(1) = 21600 = 2^5 * 3^3 * 5^2
28 s(129) = t(27) = 33075 = 3^3 * 5^2 * 7^2
32 s(137) = q(2) = 36000 = 2^5 * 3^2 * 5^3
38 s(151) = q(3) = 42336 = 2^5 * 3^3 * 7^2
65 s(237) = t(60) = 88200 = 2^3 * 3^2 * 5^2 * 7^2
1592 s(3268) = t(1459) = 10672200 = 2^3 * 3^2 * 5^2 * 7^2 * 11^2
4128739 s(6505162) = 31492800000000 = 2^12 * 3^9 * 5^8
.
A393708(12) = 10800 = 2^4 * 3^3 * 5^2 is not in this sequence since among exponents, we have 2 | 4.
MATHEMATICA
nn = 2^16; fQ[x_] := And[Length[#] > 2, GCD @@ # == 1, Count[Tuples[#, 2], _?(And[UnsameQ @@ #, Divisible @@ #] &)] == 0] &[FactorInteger[x][[All, -1]] ]; Union@ Flatten@ Table[If[fQ[#], #, Nothing] &[a^2*b^3], {b, Surd[nn, 3]}, {a, Sqrt[nn/b^3] } ]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michael De Vlieger, Apr 06 2026
STATUS
approved
