Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147647
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147647 Nine-digit numbers with all distinct digits such that the string formed by the last k digits is divisible by k for any 1<=k<=9. +0
2
123567480, 123675840, 123756480, 126573840, 132576840, 132657480, 132765840, 135648720, 135726840, 138546720, 138675240, 147528360, 153276840, 153672480, 153768240, 156237840, 156348720, 162573480, 165327840, 165378240, 165438720 (list; graph; listen)
OFFSET

1,1

COMMENT

There are exactly 202 such numbers, a(n)=A140501(n)-9000000000.

FORMULA

a(n)=A140501(n)-9000000000.

CROSSREFS

A140501, A147636, A147637.

Sequence in context: A068247 A050289 A053654 this_sequence A068249 A162450 A115301

Adjacent sequences: A147644 A147645 A147646 this_sequence A147648 A147649 A147650

KEYWORD

base,fini,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