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 A068500 #17 Jul 22 2024 13:05:21
%S A068500 1,2,3,5,8,55,89,987,28657,196418,1346269,3524578,5702887,39088169,
%T A068500 267914296,4807526976,7778742049,139583862445,591286729879,
%U A068500 1304969544928657,5527939700884757,99194853094755497,83621143489848422977,218922995834555169026,927372692193078999176
%N A068500 Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.
%H A068500 Reinhard Zumkeller, <a href="/A068500/b068500.txt">Table of n, a(n) for n = 1..225</a>
%e A068500 a(8)=987 and 9+8+7=24 and sum of digits of any Fibonacci numbers < 987 is also less than 24.
%t A068500 terms = 30; Reap[For[n = k = 1; record = 0, n <= terms, k++, an = Fibonacci[k]; t = Total[IntegerDigits[an]]; If[t > record, record = t; Print["a(", n, ") = ", an]; Sow[an]; n++]]][[2, 1]] (* _Jean-François Alcover_, Apr 02 2017 *)
%t A068500 DeleteDuplicates[Table[{f,Total[IntegerDigits[f]]},{f,Fibonacci[Range[150]]}],GreaterEqual[ #1[[2]],#2[[2]]]&][[;;,1]] (* _Harvey P. Dale_, Jul 22 2024 *)
%o A068500 (Haskell)
%o A068500 a068500 n = a068500_list !! (n-1)
%o A068500 a068500_list = h 0 a004090_list a000045_list where
%o A068500 h r (q:qs) (f:fs) = if q <= r then h r qs fs else f : h q qs fs
%o A068500 -- _Reinhard Zumkeller_, Oct 26 2015
%o A068500 (PARI) lista(nn) = {s = 0; for (n=1, nn, if ((ns = sumdigits(f=fibonacci(n))) > s, print1(f, ", "); s = ns););} \\ _Michel Marcus_, Apr 02 2017
%Y A068500 Cf. A000045, A007953, A004090.
%K A068500 nice,nonn,base
%O A068500 1,2
%A A068500 _Shyam Sunder Gupta_, Mar 25 2002