cp's OEIS Frontend

A272377 Number of positive divisors of A000032(n).

%I A272377 #13 Sep 01 2019 10:55:12
%S A272377 2,1,2,3,2,2,6,2,2,6,4,2,8,2,4,12,2,2,16,2,4,12,8,4,8,8,4,12,6,4,24,2,
%T A272377 4,12,8,16,16,2,4,24,8,2,48,4,16,96,8,2,16,4,16,24,8,2,40,24,4,24,8,8,
%U A272377 64,2,4,96,4,32,48,4,4,48,16,2,16,4,8,192,4,16,24,2,4,48,16,4,96,16,4,48,8,4,128
%N A272377 Number of positive divisors of A000032(n).
%H A272377 Amiram Eldar, <a href="/A272377/b272377.txt">Table of n, a(n) for n = 0..1000</a> (using Blair Kelly's data)
%H A272377 Blair Kelly, <a href="http://mersennus.net/fibonacci//">Fibonacci and Lucas Factorizations</a>
%F A272377 a(n) = A000005(A000032(n)).
%e A272377 a(3) = 3 because A000032(3) = 4 and 4 is divisible by 1, 2 and 4.
%t A272377 DivisorSigma[0, LucasL /@ Range[0, 90]] (* _Michael De Vlieger_, Apr 28 2016 *)
%o A272377 (PARI) a(n) = numdiv(fibonacci(n-1)+fibonacci(n+1));
%Y A272377 Cf. A000005, A000032, A063375.
%K A272377 nonn,easy
%O A272377 0,1
%A A272377 _Altug Alkan_, Apr 28 2016