login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084687 Nontrivial numbers k containing no zero digits which are divisible by the number formed by writing the digits of k in ascending order. 6
9513, 81816, 93513, 94143, 95193, 816816, 888216, 933513, 934143, 935193, 941493, 951993, 2491578, 8166816, 8868216, 9333513, 9334143, 9335193, 9341493, 9351993, 9414993, 9519993, 24915798, 49827156, 81666816, 87127446, 88668216, 93333513 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Sequence excludes numbers which are already sorted, like 1234 or 133778, as sorting any such number yields the same number, which is of course divisible by itself, a trivial case.

All members of this sequence appear to be divisible by 3. Further, many of the terms of the sequence can be generated patternistically simply by inserting digits in certain places in earlier terms. The primitive terms of this sequence which cannot be patternistically generated are in sequence A086083.

All terms are divisible by 3.  Proof: if the digits of x*y are a permutation of the digits of x, we must have x*y==x (mod 9), implying either x == 0 (mod 3) or y == 1 (mod 9). - Robert Israel, Jul 09 2020

LINKS

Robert Israel, Table of n, a(n) for n = 1..208

EXAMPLE

9513/1359 = 7; 9876543192/1234567899 = 8; etc.

MAPLE

S:= [seq([i], i=1..9)]: R:= NULL: count:= 0:

for d from 2 to 8 do

  S:= map(t -> seq([i, op(t)], i=1..t[1]), S);

  for s in S do

    x:= add(s[i]*10^(d-i), i=1..d);

    if x mod 3 <> 0 then next fi;

    for m from 2 to 10^(d+1)/x do

      if sort(convert(m*x, base, 10))=s then

        count:= count+1; R:= R, m*x;

      fi

    od

  od

od:

sort([R]); # Robert Israel, Jul 09 2020

MATHEMATICA

Select[ Range[ 10^8], IntegerQ[ # /FromDigits[ Sort[ IntegerDigits[ # ]]]] && # != FromDigits[ Sort[ IntegerDigits[ # ]]] && Count[ IntegerDigits[ # ], 0] == 0 & ]

CROSSREFS

Cf. A086083.

Sequence in context: A235420 A236281 A282228 * A086083 A202613 A236161

Adjacent sequences:  A084684 A084685 A084686 * A084688 A084689 A084690

KEYWORD

base,nonn

AUTHOR

Chuck Seggelin (barkeep(AT)plastereddragon.com), Jun 30 2003

EXTENSIONS

Edited by Robert G. Wilson v, Jul 07 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 23 21:51 EST 2020. Contains 338603 sequences. (Running on oeis4.)