OFFSET
1,1
COMMENTS
4.5 log(phi)/log(10) = 0.94... < 1, so this sequence is probably finite. The last term appears to be a(224) = F_5832 = 2927...6784; if there is another term it is greater than 10^20000. - Charles R Greathouse IV, Nov 19 2010
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..224
EXAMPLE
F(11)=89 and 8+9=17 > 11, so 89 is the term of this sequence.
MATHEMATICA
Fibonacci[#]&/@Select[Range[100], Total[IntegerDigits[Fibonacci[#]]]>#&] (* Harvey P. Dale, Apr 14 2014 *)
PROG
(Haskell)
a068498 n = a068498_list !! (n-1)
a068498_list = f [0..] a000045_list where
f (u:us) (v:vs) = if u < a007953 v then v : f us vs else f us vs
-- Reinhard Zumkeller, Apr 15 2014, Dec 16 2013
(PARI) lista(nn) = {for(n=1, nn, if (sumdigits(f=fibonacci(n)) > n, print1(f, ", "))); } \\ Michel Marcus, Apr 15 2014
CROSSREFS
KEYWORD
nice,nonn,base
AUTHOR
Shyam Sunder Gupta, Mar 25 2002
EXTENSIONS
Corrected and extended by Harvey P. Dale, Apr 14 2014
Haskell program and b-file corrected. Thanks to Harvey P. Dale. - Reinhard Zumkeller, Apr 15 2014
STATUS
approved