login
This site is supported by donations to The OEIS Foundation.
Logo

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; internal format)
OFFSET

0,2

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

A062884, A062885.

Sequence in context: A070788 A030148 A068061 * A062886 A133452 A189293

Adjacent sequences:  A062884 A062885 A062886 * A062888 A062889 A062890

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 28 2001

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Mar 25 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.