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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260462 Numbers k such that the digits of k are in increasing order and k divides (reverse(k) * 10^m) for some sufficiently-large integer m. 2
12, 15, 16, 18, 24, 25, 36, 45, 48, 125, 128, 144, 168, 225, 256, 288, 1125, 1344, 2688, 12288, 111888 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

This sequence consists of the set of distinct numbers that result from taking the terms of A260461, sorting the digits of each term in ascending order, and discarding the leading zeros.

(Equivalently, this sequence consists of the set of distinct numbers that result from taking the terms of A096091 whose nonzero digits are not all the same, sorting the digits of each term in ascending order, and discarding the leading zeros.)

Through a(21) = 111888, the digits 7 and 9 do not appear.

After a(21) = 111888, there are no more terms through 10^27. Presumably, the sequence is full. Is there a proof?

LINKS

Table of n, a(n) for n=1..21.

CROSSREFS

Cf. A096091, A260461.

Sequence in context: A180575 A115402 A297790 * A114443 A188766 A247542

Adjacent sequences:  A260459 A260460 A260461 * A260463 A260464 A260465

KEYWORD

nonn,base

AUTHOR

Jon E. Schoenfield, Jul 26 2015

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 October 25 17:22 EDT 2021. Contains 348255 sequences. (Running on oeis4.)