Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147636
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
4
0, 10, 102, 1024, 12360, 123480, 1249360, 12495360, 123567480, 9123567480 (list; graph; listen)
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 this_sequence A147550 A162666 A061630

Adjacent sequences: A147633 A147634 A147635 this_sequence A147637 A147638 A147639

KEYWORD

base,fini,full,nonn

AUTHOR

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

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research