The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062887 Smallest multiple of 2n+1 with property that digits are odd and each digit is two less (mod 10) than the previous digit. 0
 1, 3, 5, 7, 9, 319, 975, 75, 7531, 19, 197531975319, 3197, 75, 5319, 319, 31, 3197531975319, 53197531975, 1975319, 975, 531975, 1975319753197, 19753197531975, 75319753197531, 319753197531975319, 753197531975319753 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS EXAMPLE a(7) = 975 = 13*75 has decreasing odd digits. MAPLE 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); CROSSREFS Sequence in context: A068061 A332970 A316492 * A062886 A319585 A133452 Adjacent sequences:  A062884 A062885 A062886 * A062888 A062889 A062890 KEYWORD nonn,base,easy AUTHOR Amarnath Murthy, Jun 28 2001 EXTENSIONS More terms from Sascha Kurz, Mar 25 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 21:07 EST 2021. Contains 349344 sequences. (Running on oeis4.)