A096089 Let f(n) = largest number formed using digits of n, g(n) = smallest number formed using digits of n; then a(n) = floor(f(n)/g(n)).

1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 2, 2, 3, 3, 4, 4, 4, 10, 1, 1, 1, 1, 2, 2, 2, 2, 3, 10, 2, 1, 1, 1, 1, 1, 1, 2, 2, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 10, 3, 2, 1, 1, 1, 1, 1, 1, 1, 10, 3, 2, 1, 1, 1, 1, 1, 1, 1, 10, 4, 2, 1, 1, 1, 1, 1, 1, 1, 10, 4, 2, 2, 1, 1, 1, 1, 1, 1, 10, 4, 3, 2, 1, 1, 1, 1, 1, 1, 100, 10, 17, 23, 29, 34

Offset: 1

Author

Amarnath Murthy, Jun 22 2004

Keywords

• base
• nonn
• easy
• look

Examples

			a(12324) = floor(43221/12234) = 3.
a(1098) = floor(9810/0189) = 51.
		

Links

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

Crossrefs

Cf. A004186, A004185, A096090, A096091.

Programs

Maple

A096089 := proc(n)
    floor( A004186(n)/A004185(n)) ;
end proc: # R. J. Mathar, Jul 26 2015

PARI

a(n) = d = digits(n); fromdigits(vecsort(d, , 4)) \ fromdigits(vecsort(d))

Extensions

More terms from Sam Handler (sam_5_5_5_0(AT)yahoo.com), Jul 19 2004

a(1)..a(9) prepended by David A. Corneth, Jan 21 2019