%I A055491
%S A055491 1,4,9,1,25,36,49,4,1,100,121,9,169,196,225,1,289,4,361,25,441,484,529,
%T A055491 36,1,676,9,49,841,900,961,4,1089,1156,1225,1,1369,1444,1521,100,1681,
%U A055491 1764,1849,121,25,2116,2209,9,1,4,2601,169,2809,36,3025,196,3249,3364
%N A055491 Smallest square divisible by n divided by largest square which divides 
               n.
%C A055491 If n is written as Product(Pj^Ej) then a(n) = Product(Pj^(2*(Ej mod 2)))
%H A055491 H. Bottomley, <a href="http://www.gallup.unm.edu/~smarandache/math.htm">
               Some Smarandache-type multiplicative sequences</a>
%F A055491 a(n) = A053143(n)/A008833(n) = A007913(n)^2 = (A019554(n)/A000188(n))^2 
               = A000290(n)/A008833(n)^2
%e A055491 a(12) = 36/4 = 9
%Y A055491 Cf. A056551, A056552.
%Y A055491 Sequence in context: A070638 A152205 A129861 this_sequence A032523 A032760 
               A129970
%Y A055491 Adjacent sequences: A055488 A055489 A055490 this_sequence A055492 A055493 
               A055494
%K A055491 easy,nonn,mult
%O A055491 1,2
%A A055491 Henry Bottomley (se16(AT)btinternet.com), Jun 28 2000