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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A147636 a(n) = least n-distinct-decimal-digit number such that the string formed by the last k digits is divisible by k for any 1<=k<=n. 3
0, 10, 102, 1024, 12360, 123480, 1249360, 12495360, 123567480, 9123567480 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

A140501 Ten-digit numbers with all distinct digits such that the string formed by the last k digits is divisible by k for any k <=10. A147637 a(n) = largest n-distinct-decimal-digit number such that the string formed by the last k digits is divisible by k for any 1<=k<=n.

Sequence in context: A037680 A038378 A158242 * A191014 A147550 A162666

Adjacent sequences:  A147633 A147634 A147635 * A147637 A147638 A147639

KEYWORD

base,fini,full,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Nov 09 2008

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 14 01:35 EST 2012. Contains 205567 sequences.