login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096091 k such that f(k) mod g(k) = 0, where f(k) = largest number formed using digits of k, g(k) = smallest number formed using digits of k. 2
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 22, 30, 33, 40, 44, 50, 55, 60, 66, 70, 77, 80, 88, 90, 99, 100, 110, 111, 200, 220, 222, 300, 330, 333, 400, 440, 444, 500, 510, 540, 550, 555, 600, 660, 666, 700, 770, 777, 800, 810, 880, 888, 900, 990, 999, 1000, 1001, 1100 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

All palindromes are trivial members. N = d*10^m*(10^n-1)/9 is a member for all m, n where 1 < d < 10. And one gets f(N)/g(N) = 10^m. e.g. for d= 7 m = 4, n = 8 we get N = 777777770000. Conjecture: There are infinitely many terms other than these.

EXAMPLE

110 is a member as 110/011=10.

MATHEMATICA

f[n_] := Block[{p = FromDigits /@ Permutations[IntegerDigits[n]]}, Mod[ p[[1]], p[[ -1]] ]]; Select[ Range[1111], f[ # ] == 0 &] (from Robert G. Wilson v Jun 23 2004)

CROSSREFS

Cf. A096089, A096090.

Sequence in context: A061917 A125289 A180482 * A193460 A055933 A188650

Adjacent sequences:  A096088 A096089 A096090 * A096092 A096093 A096094

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 22 2004

EXTENSIONS

Edited, corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 23 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:25 EST 2012. Contains 205786 sequences.