OFFSET
1,1
COMMENTS
From Michael De Vlieger, Sep 21 2025: (Start)
Let g = gpf(k) = A006530(k) be the greatest prime factor of k. Then a(n) = k is such that g^2 | k, and terms in this sequence cannot be squarefree, thus this sequence is a subset of A013929.
Furthermore, k >= rad(k)*g, where rad = A007947, and A003557(k) = k/rad(k) exceeds the second smallest prime factor A119288(k) of k. As a consequence regarding terms in A024619, this sequence does not intersect A366825 (i.e., m = lpf(k)*k with k in A120944, implies m in A126706, where lpf = A020639). This sequence also does not intersect A360967 (i.e., numbers k in A126706 such that A003557(k) < A119288(k)).
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
FORMULA
k is term <=> k has canonical prime factorization p1^e1 *...* pj^ej with ej >= 2 and some ei in e1...ej is odd.
MATHEMATICA
Select[Range[2^10], And[! IntegerQ[Sqrt[#]], Divisible[#, Power[FactorInteger[#][[-1, 1]], 2]]] &] (* Michael De Vlieger, Sep 21 2025 *)
PROG
(SageMath)
def isA388306(n: int) -> int: return not is_square(n) and factor(n)[-1][1] > 1
print([n for n in range(1000) if isA388306(n)])
(PARI) isok(k) = !issquare(k) && !(k % vecmax(factor(k)[, 1])^2); \\ Michel Marcus, Sep 21 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Sep 21 2025
STATUS
approved
