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 A272918 #23 May 27 2021 11:03:40
%S A272918 0,1,1,2,3,5,8,13,12,34,55,89,144,233,377,16,789,1579,2458,1148,5667,
%T A272918 1469,11177,25678,34668,2557,112339,114689,111378,122459,2348,1234669,
%U A272918 123789,2345578,257788,2245679,1233459,11245778,1368899,23456689,11233455,11145568
%N A272918 Fibonacci numbers with the base 10 digits sorted into increasing order.
%C A272918 Leading zeros are omitted, of course.
%H A272918 G. C. Greubel, <a href="/A272918/b272918.txt">Table of n, a(n) for n = 0..500</a>
%F A272918 a(n) = A004185(A000045(n)). - _Michel Marcus_, May 17 2016
%e A272918 a(8) = 12 because F(8) = 21, so the digits in ascending order become 12.
%e A272918 a(9) = 34 = F(9), the digits are already in ascending order.
%t A272918 Table[FromDigits[Sort[IntegerDigits[Fibonacci[n]]]], {n, 0, 49}]
%o A272918 (Python)
%o A272918 from gmpy2 import fib
%o A272918 for n in range(500):
%o A272918 print(''.join(sorted(list(str(fib(n))))),end=', ')
%o A272918 # _Soumil Mandal_, May 14 2016
%Y A272918 Cf. A000045, A004185.
%K A272918 nonn,base,easy
%O A272918 0,4
%A A272918 _Alonso del Arte_, May 10 2016