This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063477 a(n) = sum of the divisors of Fibonacci(n) (A000045). 4
 1, 1, 3, 4, 6, 15, 14, 32, 54, 72, 90, 403, 234, 420, 1116, 1536, 1598, 5400, 4332, 12096, 17724, 18000, 28658, 157248, 93062, 122148, 320760, 473760, 514230, 2142720, 1349244, 3391488, 5346540, 5708056, 11924808, 48211200, 24664200 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Amiram Eldar, Table of n, a(n) for n = 1..1408 (terms 1..1000 from T. D. Noe using Blair Kelly's data) Blair Kelly, Fibonacci and Lucas Factorizations FORMULA a(n) = sigma(A000045(n)) = A000203(A000045(n)). - Omar E. Pol, Dec 20 2008 MATHEMATICA DivisorSigma[1, Fibonacci@Range@40] (* Vladimir Reshetnikov, Nov 13 2015 *) PROG (PARI) j=[]; for(n=1, 50, j=concat(j, sigma(fibonacci(n)))); j (Sage) [sigma(fibonacci(n), 1) for n in xrange(1, 38)] # Zerinvary Lajos, Jun 04 2009 CROSSREFS Cf. A000045. Cf. A000203. - Omar E. Pol, Dec 20 2008 Sequence in context: A271618 A137820 A049892 * A168219 A129827 A325179 Adjacent sequences:  A063474 A063475 A063476 * A063478 A063479 A063480 KEYWORD easy,nonn,changed AUTHOR Jason Earls, Jul 28 2001 STATUS approved

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

Last modified October 17 06:08 EDT 2019. Contains 328106 sequences. (Running on oeis4.)