Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062399
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
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; listen)
OFFSET

0,3

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 this_sequence A121603 A031086 A127288

Adjacent sequences: A062396 A062397 A062398 this_sequence A062400 A062401 A062402

KEYWORD

nonn,base,easy

AUTHOR

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

EXTENSIONS

More terms from Erich Friedman (efriedma(AT)stetson.edu), Jun 30 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research