OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harry J. Smith)
MATHEMATICA
psQ[n_]:=Module[{d=Divisors[n]}, IntegerQ[Sqrt[Total[d]]] && IntegerQ[ Sqrt[Times@@d]]]; Select[Range[1200], psQ] (* Harvey P. Dale, Mar 07 2012 *)
PROG
(PARI) pd(n) = n^(numdiv(n)/2);
for(n=1, 2000, if(issquare(sigma(n)) && issquare(pd(n)), print1(n, ", ")))
(PARI) pd(n)= { d=numdiv(n); if (d%2, round(sqrt(n))^d, n^(d/2)) }
{ n=0; for (m=1, 10^9, if (issquare(sigma(m)) && issquare(pd(m)), write("b064710.txt", n++, " ", m); if (n==1000, break)) ) } \\ Harry J. Smith, Sep 23 2009
(Sage) [n for n in (1..100000) if sigma(n).is_square()and prod(divisors(n)).is_square()] # Giuseppe Coppoletta, Dec 16 2014
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Oct 13 2001
EXTENSIONS
Corrected by Harvey P. Dale, Oct 23 2001
STATUS
approved