Search: id:A062887
Results 1-1 of 1 results found.

%I A062887
%S A062887 1,3,5,7,9,319,975,75,7531,19,197531975319,3197,75,5319,319,31,
%T A062887 3197531975319,53197531975,1975319,975,531975,1975319753197,
%U A062887 19753197531975,75319753197531,319753197531975319,753197531975319753
%N A062887 Smallest multiple of 2n+1 with property that digits are odd and each 
               digit is two less (mod 10) than the previous digit.
%e A062887 a(7) = 975 = 13*75 has decreasing odd digits.
%p A062887 l := 0:for i from 1 to 35 do for j from 1 to 5 do a := 0:for h from 1 
               to i do a := 10*a+((2*j+1-2*h) mod 10):end do:l := l+1:q[l] := a:end 
               do:end do:s := seq(q[ll],ll=1..l); for i from 1 to 65 do k := 1:while((s[k] 
               mod (2*i-1))>0) do k := k+1:end do: w[i] := s[k]:end do:seq(w[j],
               j=1..65);
%Y A062887 A062884, A062885.
%Y A062887 Sequence in context: A070788 A030148 A068061 this_sequence A062886 A133452 
               A140607
%Y A062887 Adjacent sequences: A062884 A062885 A062886 this_sequence A062888 A062889 
               A062890
%K A062887 nonn,base,easy
%O A062887 0,2
%A A062887 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 28 2001
%E A062887 More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Mar 25 
               2002

Search completed in 0.001 seconds