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 A272439 #13 Sep 01 2019 10:54:41 %S A272439 3,1,4,7,8,12,39,30,48,140,168,200,576,522,1128,2688,2208,3572,12960, %T A272439 9350,17296,44520,54208,64680,158976,186048,361928,809200,826728, %U A272439 1169400,4131036,3010350,4876416,13862800,17256768,23639040,59720832,54018522,116538408,251395200,233917632,370248452,1319232096 %N A272439 Sum of positive divisors of A000032(n). %H A272439 Amiram Eldar, <a href="/A272439/b272439.txt">Table of n, a(n) for n = 0..1000</a> (using Blair Kelly's data) %H A272439 Blair Kelly, <a href="http://mersennus.net/fibonacci//">Fibonacci and Lucas Factorizations</a> %F A272439 a(n) = A000203(A000032(n)). %e A272439 a(2) = 4 because A000032(2) = 3 and A000203(3) = 4. %t A272439 DivisorSigma[1, LucasL@ Range[0, 42]] (* _Michael De Vlieger_, Apr 29 2016 *) %o A272439 (PARI) a(n) = sigma(fibonacci(n-1) + fibonacci(n+1)); %Y A272439 Cf. A000032, A000203. %K A272439 nonn %O A272439 0,1 %A A272439 _Altug Alkan_, Apr 29 2016