%I A080733
%S A080733 0,0,0,1,0,0,0,1,1,0,0,1,0,0,0,1,0,1,0,1,0,0,0,1,1,0,1,1,0,0,0,1,0,0,0,
%T A080733 1,0,0,0,1,0,0,0,1,1,0,0,1,2,1,0,1,0,1,0,1,0,0,0,1,0,0,1,1,0,0,0,1,0,0,
%U A080733 0,1,0,0,1,1,0,0,0,1,1,0,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,1,2,1,0,0,0,1,0
%N A080733 Smallest distance from n to a squarefree number.
%C A080733 a(n)=min (abs(n-k) : where k runs through the squarefree numbers )
%C A080733 The sequence is unbounded.
%F A080733 a(A005117(n))=0
%Y A080733 Cf. A051699.
%Y A080733 Cf. A005117, A081221.
%Y A080733 Sequence in context: A144961 A144627 A135929 this_sequence A080732 A088568 
               A123737
%Y A080733 Adjacent sequences: A080730 A080731 A080732 this_sequence A080734 A080735 
               A080736
%K A080733 nonn
%O A080733 1,49
%A A080733 Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 08 2003