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 A089247 #7 Sep 02 2015 13:58:34 %S A089247 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,12,19,20,21,22,23,24,25,26, %T A089247 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49, %U A089247 20,51,52,53,24,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72 %N A089247 a(n) = smallest number obtainable by permuting the exponents in the prime factorization of n. %H A089247 Reinhard Zumkeller, <a href="/A089247/b089247.txt">Table of n, a(n) for n = 1..10000</a> %o A089247 (Haskell) %o A089247 import Data.List (sort) %o A089247 a089247 n = product $ zipWith (^) %o A089247 (a027748_row n) (reverse $ sort $ a124010_row n) %o A089247 -- _Reinhard Zumkeller_, Apr 27 2013 %o A089247 (PARI) a(n)=my(f=factor(n)); f[,2]=vecsort(f[,2],,4); factorback(f) \\ _Charles R Greathouse IV_, Sep 02 2015 %Y A089247 Cf. A027748, A124010, A046523, A071364, A085079. %K A089247 easy,nonn %O A089247 1,2 %A A089247 _Sam Alexander_, Dec 11 2003