login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025490 In base 11, a(n) = sum of digits of Fib(a(n)). 1
0, 1, 5, 13, 41, 53, 55, 60, 61, 90, 97, 169, 185, 193, 215, 265, 269, 353, 355, 385, 397, 437, 481, 493, 617, 629, 630, 653, 713, 750, 769, 780, 889, 905, 960, 1013, 1025, 1045, 1205, 1320, 1405, 1435, 1501, 1620, 1650, 1657, 1705, 1735, 1769, 1793, 1913, 1981 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

In his article, Terr estimated the count to be 684 +/- 26, which agress with the found count of 710. Especially when compared with the count of 284 for the same sequence with Lucas numbers (A025491), having numbers up to the same size in the sequence. - Sven Simon, Aug 06 2006

LINKS

Sven Simon, Table of n, a(n) for n = 0..710, searched up to index 7500000 [May be complete]

David Terr, On the Sums of Digits of Fibonacci Numbers, Fibonacci Quarterly 34, Aug. 1996, pp. 349-355.

CROSSREFS

Sequence in context: A054856 A121872 A228922 * A216824 A230812 A087938

Adjacent sequences:  A025487 A025488 A025489 * A025491 A025492 A025493

KEYWORD

base,nonn

AUTHOR

David W. Wilson

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified April 19 21:10 EDT 2014. Contains 240777 sequences.