A068500 Sequence of Fibonacci numbers whose sum of decimal digits sets a new record.

1, 2, 3, 5, 8, 55, 89, 987, 28657, 196418, 1346269, 3524578, 5702887, 39088169, 267914296, 4807526976, 7778742049, 139583862445, 591286729879, 1304969544928657, 5527939700884757, 99194853094755497, 83621143489848422977, 218922995834555169026, 927372692193078999176

Offset: 1

Author

Shyam Sunder Gupta, Mar 25 2002

Keywords

• nice
• nonn
• base

Examples

			a(8)=987 and 9+8+7=24 and sum of digits of any Fibonacci numbers < 987 is also less than 24.
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..225

Crossrefs

Cf. A000045, A007953, A004090.

Programs

Haskell

a068500 n = a068500_list !! (n-1)
a068500_list = h 0 a004090_list a000045_list where
   h r (q:qs) (f:fs) = if q <= r then h r qs fs else f : h q qs fs
-- Reinhard Zumkeller, Oct 26 2015

Mathematica

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 *)
DeleteDuplicates[Table[{f,Total[IntegerDigits[f]]},{f,Fibonacci[Range[150]]}],GreaterEqual[ #1[[2]],#2[[2]]]&][[;;,1]] (* Harvey P. Dale, Jul 22 2024 *)

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