OFFSET
1,1
COMMENTS
Numbers that are odd squares, 3 is their smallest prime factor, and are refactorable.
See A033950 for references. For any prime p, p^(p-1) is the smallest element of RF(p), the refactorable numbers whose smallest prime factor is p. Thus 3^(3-1)=9 is the first element. Other elements would also be 3^2*17^2 or 3^16*17^2.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MAPLE
with(numtheory); RF3:=[]: p:=3: for w to 1 do for j from 1 to 12^3 do k:=2*j+1; if k mod p = 0 then n:=k^2; t:=tau(n); if (n mod t = 0) then RF3:=[op(RF3), n]; print(ifactor(n)); fi fi; od od;
PROG
(PARI) lista(kmax) = forstep(k = 3, kmax, 6, if(!(k^2 % numdiv(k^2)), print1(k^2, ", "))); \\ Amiram Eldar, Aug 01 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Walter Kehowski, Jun 20 2006
EXTENSIONS
a(37)-a(39) from Amiram Eldar, Aug 01 2024
STATUS
approved