This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A096089 #21 Jan 26 2024 04:44:34 %S A096089 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, %T A096089 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, %U A096089 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 %N 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)). %H A096089 Robert Israel, <a href="/A096089/b096089.txt">Table of n, a(n) for n = 1..10000</a> %e A096089 a(12324) = floor(43221/12234) = 3. %e A096089 a(1098) = floor(9810/0189) = 51. %p A096089 A096089 := proc(n) %p A096089 floor( A004186(n)/A004185(n)) ; %p A096089 end proc: # _R. J. Mathar_, Jul 26 2015 %o A096089 (PARI) a(n) = d = digits(n); fromdigits(vecsort(d, , 4)) \ fromdigits(vecsort(d)) %Y A096089 Cf. A004186, A004185, A096090, A096091. %K A096089 base,nonn,easy,look %O A096089 1,10 %A A096089 _Amarnath Murthy_, Jun 22 2004 %E A096089 More terms from Sam Handler (sam_5_5_5_0(AT)yahoo.com), Jul 19 2004 %E A096089 a(1)..a(9) prepended by _David A. Corneth_, Jan 21 2019