This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A063477 #44 Jan 05 2025 19:51:36 %S A063477 1,1,3,4,6,15,14,32,54,72,90,403,234,420,1116,1536,1598,5400,4332, %T A063477 12096,17724,18000,28658,157248,93062,122148,320760,473760,514230, %U A063477 2142720,1349244,3391488,5346540,5708056,11924808,48211200,24664200 %N A063477 a(n) is the sum of the divisors of Fibonacci(n) (A000045). %H A063477 Amiram Eldar, <a href="/A063477/b063477.txt">Table of n, a(n) for n = 1..1408</a> (terms 1..1000 from T. D. Noe using Blair Kelly's data) %H A063477 Blair Kelly, <a href="http://mersennus.net/fibonacci/">Fibonacci and Lucas Factorizations</a>. %H A063477 Florian Luca, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/37-3/luca.pdf">Arithmetic Functions of Fibonacci Numbers</a>, The Fibonacci Quarterly, Vol. 37, No. 3 (1999), pp. 265-268. %F A063477 a(n) = sigma(A000045(n)) = A000203(A000045(n)). - _Omar E. Pol_, Dec 20 2008 %F A063477 a(n) <= A000045(A000203(n)), with equality if and only if n = 1 or 3 (Luca, 1999). - _Amiram Eldar_, Jan 12 2022 %t A063477 DivisorSigma[1, Fibonacci@Range@40] (* _Vladimir Reshetnikov_, Nov 13 2015 *) %o A063477 (PARI) j=[]; for(n=1,50,j=concat(j, sigma(fibonacci(n)))); j %o A063477 (Sage) [sigma(fibonacci(n),1) for n in range(1,38)] # _Zerinvary Lajos_, Jun 04 2009 %Y A063477 Cf. A000045, A000203. %K A063477 nonn %O A063477 1,3 %A A063477 _Jason Earls_, Jul 28 2001