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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063477 Sum of the divisors of Fibonacci(n) (A000045). 3
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; internal format)
OFFSET

1,3

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000 (using Blair Kelly's data)

FORMULA

a(n) = sigma(A000045(n)) = A000203(A000045(n)). [From Omar E. Pol (info(AT)polprimos.com), Dec 20 2008]

MATHEMATICA

lst={}; Do[AppendTo[lst, DivisorSigma[1, Fibonacci[n]]], {n, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 20 2008]

PROG

(PARI) j=[]; for(n=1, 50, j=concat(j, sigma(fibonacci(n)))); j

(Other) sage: [sigma(fibonacci(n), 1)for n in xrange(1, 38)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 04 2009]

(PARI) { h=1; g=f=0; for (n=1, 380, f+=h; h=g; g=f; write("b063477.txt", n, " ", sigma(f)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 23 2009]

CROSSREFS

Cf. A000045.

Cf. A000203. [From Omar E. Pol (info(AT)polprimos.com), Dec 20 2008]

Sequence in context: A180859 A137820 A049892 * A168219 A129827 A122727

Adjacent sequences:  A063474 A063475 A063476 * A063478 A063479 A063480

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 28 2001

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

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

Last modified February 17 04:44 EST 2012. Contains 205983 sequences.