%I A071577
%S A071577 1,1,1,5,5,5,5,9,9,9,9,9,9,9,9,63,63,63,63,63,63,63,63,135,135,135,135,
%T A071577 135,135,135,135,135,135,135,135,135,135,135,135,135,135,135,135,735,
%U A071577 735,735,945,945,945,1155,1155,1155,1155,1155,1155,1155
%N A071577 Smallest k such that 2ik+1 is squarefree for 1<=i<=n.
%o A071577 (PARI) for(n=1,56,s=1; while(sum(i=1,n,issquarefree(2*i*s+1))<n,s++); 
               print1(s, ","))
%Y A071577 Sequence in context: A139259 A105444 A033299 this_sequence A003870 A076407 
               A134701
%Y A071577 Adjacent sequences: A071574 A071575 A071576 this_sequence A071578 A071579 
               A071580
%K A071577 easy,nonn
%O A071577 1,4
%A A071577 Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2002