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 A273045 #24 May 17 2016 11:18:45 %S A273045 0,1,1,2,3,5,8,13,34,55,89,144,233,377 %N A273045 Fibonacci numbers with digits in nondecreasing order. %C A273045 Intersection of A000045 and A009994. - _Felix Fröhlich_, May 16 2016 %C A273045 Conjecture: The sequence is finite, with 377 being the last term. I have verified the conjecture up to A000045(10^5). - _Felix Fröhlich_, May 16 2016 %C A273045 Conjecture verified up to Fibonacci(10^8). - _Charles R Greathouse IV_, May 17 2016 %t A273045 Select[Fibonacci@ Range[0, 10^4], Sort@ # == # &@ IntegerDigits@ # &] (* _Michael De Vlieger_, May 13 2016 *) %o A273045 (PARI) is_a009994(n) = digits(n)==vecsort(digits(n)) %o A273045 for(n=0, 1e4, if(is_a009994(fibonacci(n)), print1(fibonacci(n), ", "))) \\ _Felix Fröhlich_, May 16 2016 %o A273045 (PARI) fibmod(n,m)=lift(((Mod([1,1;1,0],m))^n)[1,2]) %o A273045 isA009994(n)=my(d=digits(n)); vecsort(d)==d %o A273045 B1=10^9;B2=10^57; %o A273045 for(n=1,1e9, if(isA009994(fibmod(n,B1)) && isA009994(fibmod(n,B2)) && isA009994(F=fibonacci(n)), print1(F", "))) \\ _Charles R Greathouse IV_, May 17 2016 %Y A273045 Cf. A000045, A009994, A272918, A273046. %K A273045 nonn,base %O A273045 1,4 %A A273045 _Omar E. Pol_, May 13 2016 %E A273045 Offset adjusted by _Felix Fröhlich_, May 16 2016