%I A076144
%S A076144 1,1,2,3,5,6,7,10,11,13,14,15,17,19,21,22,23,26,29,30,31,33,34,35,37,
%T A076144 38,39,41,42,43,46,47,51,53,55,57,58,59,61,62,65,66,67,69,70,71,73,74,
%U A076144 77,78,79,82,83,85,86,87,89,91,93,94,95,97,101,102,103,105,106,107,109
%N A076144 Largest square-free m <= sfn(n) such that m*sfn(n) is also square-free, 
               where sfn(n) is the n-th square-free number.
%C A076144 gcd(a(n),spf(n))=1;
%C A076144 a(n+1)=sfn(n) for n<106, but a(107)=173=sfn(105), as sfn(107)*sfn(106)=177*174=(3*59)*(2*3*29) 
               is not square-free.
%Y A076144 a(i+1) = A005117(i) only for 1<=i<106. Cf. A077395.
%Y A076144 Sequence in context: A122144 A064052 A064594 this_sequence A005117 A144338 
               A077377
%Y A076144 Adjacent sequences: A076141 A076142 A076143 this_sequence A076145 A076146 
               A076147
%K A076144 nonn
%O A076144 1,3
%A A076144 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 30 2002