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 A273003 #15 Sep 16 2016 15:14:31 %S A273003 0,1,1,2,3,5,8,31,21,43,55,98,441,332,773,610,987,9751,8542,8411,7665, %T A273003 96410,77111,87652,86643,75520,933211,986411,873111,954221,843200, %U A273003 9664321,9873210,8755432,8877520,9765422,95433210,87754211,99886310,98665432 %N A273003 Arrange the base 10 digits of the n-th Fibonacci number in descending order. %C A273003 Conjecture: the largest Fibonacci number F(n) with its base 10 digits already sorted in descending order is F(16) = 987. %F A273003 a(n) = A004186(A000045(n)). - _Michel Marcus_, May 15 2016 %e A273003 a(7) = 31 because F(7) = 13, so the digits in descending order become 31. %e A273003 a(8) = 21 = F(8), the digits are already in descending order. %t A273003 FromDigits[Reverse[Sort[IntegerDigits[#]]]]&/@Fibonacci[Range[0,50]] (* _Harvey P. Dale_, Sep 16 2016 *) %o A273003 (PARI) a(n)=fromdigits(vecsort(digits(fibonacci(n)),,4)) \\ _Charles R Greathouse IV_, May 15 2016 %Y A273003 Cf. A000045, A004186, A272918, A273046. %K A273003 nonn,base,easy %O A273003 0,4 %A A273003 _Alonso del Arte_, May 12 2016 %E A273003 Corrected and extended by _Harvey P. Dale_, Sep 16 2016