login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062399 Smallest multiple of n with property that each digit is one less (mod 10) than the previous digit; or 0 if no such multiple exists. 1
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 21098, 432, 65, 98, 210, 32, 765, 54, 76, 0, 21, 21098, 109876543, 432, 0, 109876, 54, 5432, 87, 210, 321098, 32, 32109, 432109876, 210, 432, 2109, 76, 3210987, 0, 876543210987, 210, 43, 432109876, 765 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
a(13) = 65 = 13*5 has decreasing digits.
MATHEMATICA
dtn[ L_ ] := Fold[ 10#1+#2&, 0, L ] a=Map[ dtn, Flatten[ Table[ Table[ Mod[ Range[ i, i-n+1, -1 ], 10 ], {i, 1, 9} ], {n, 1, 300} ], 1 ] ]; f[ n_ ] := Module[ {}, b=Select[ a, IntegerQ[ #/n ]& ]; If[ b=={}, 0, First[ b ] ] ] Table[ f[ n ], {n, 0, 63} ]
CROSSREFS
Sequence in context: A004905 A004916 A120126 * A351870 A121603 A261333
KEYWORD
nonn,base,easy
AUTHOR
Amarnath Murthy, Jun 28 2001
EXTENSIONS
More terms from Erich Friedman, Jun 30 2001
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)