%I A007956
%S A007956 1,1,1,2,1,6,1,8,3,10,1,144,1,14,15,64,1,324,1,400,21,22,1,13824,5,26,
               27,784,1,
%T A007956 27000,1,1024,33,34,35,279936,1,38,39,64000,1,74088,1,1936,2025,46,1,5308416,
               7,
%U A007956 2500,51,2704,1,157464,55,175616,57,58,1,777600000,1,62,3969,32768,65
%N A007956 Product of proper divisors of n.
%D A007956 F. Smarandache, "Only Problems, not Solutions!", Xiquan Publ., Phoenix-Chicago, 
               1993.
%H A007956 T. D. Noe, <a href="b007956.txt">Table of n, a(n) for n=1..1000</a>
%H A007956 M. L. Perez et al., eds., <a href="http://www.gallup.unm.edu/~smarandache/
               ">Smarandache Notions Journal</a>
%H A007956 F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">
               Only Problems, Not Solutions!</a>.
%F A007956 a(n) = A007955(n)/n = n^(A000005(n)/2-1) = sqrt(n^(number of factors 
               of n other than 1 and n))
%t A007956 Table[ Times @@ Select[ Divisors[ n ], #<n & ], {n, 1, 60} ]
%Y A007956 Cf. A000005, A007955.
%Y A007956 Sequence in context: A088123 A050932 A166120 this_sequence A107754 A139625 
               A053785
%Y A007956 Adjacent sequences: A007953 A007954 A007955 this_sequence A007957 A007958 
               A007959
%K A007956 nonn,easy,nice
%O A007956 1,4
%A A007956 R. Muller
%E A007956 More terms from Scott Lindhurst (ScottL(AT)alumni.princeton.edu)