|
Search: id:A161750
|
|
|
| A161750 |
|
Numbers n such that the digits of 123456789*n are all distinct |
|
+0
3
|
|
| 0, 1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 16, 17, 20, 22, 23, 25, 26, 31, 32, 34, 35, 40, 41, 43, 44, 50, 52, 53, 61, 62, 70, 71, 80
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
MAPLE
|
a := proc (n) local nn, nnn: nn := convert(123456789*n, base, 10): nnn := convert(nn, set): if nops(nn) = nops(nnn) then n else end if end proc: seq(a(n), n = 1 .. 80); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2009]
|
|
MATHEMATICA
|
m=123456789; se=Select[Range[0, 99], Sort[id=IntegerDigits[m*# ]]==Union[id]&] [From Zak Seidov (zakseidov(AT)yahoo.com), Nov 04 2009]
|
|
CROSSREFS
|
Cf. A053654. [From Zak Seidov (zakseidov(AT)yahoo.com), Nov 04 2009]
Sequence in context: A001651 A003253 A119905 this_sequence A067940 A007951 A102338
Adjacent sequences: A161747 A161748 A161749 this_sequence A161751 A161752 A161753
|
|
KEYWORD
|
easy,fini,full,nonn,new
|
|
AUTHOR
|
Kyle Stern (kstern1(AT)umbc.edu), Jun 17 2009
|
|
EXTENSIONS
|
a(1)=0 added by Zak Seidov (zakseidov(AT)yahoo.com), Nov 04 2009
|
|
|
Search completed in 0.002 seconds
|
