cp's OEIS Frontend

A219188 Sum of prime divisors (with repetition) of Lucas(n).

%I A219188 #16 Sep 05 2019 11:08:03
%S A219188 0,3,4,7,11,8,29,47,23,44,199,32,521,284,46,2207,3571,118,9349,2168,
%T A219188 244,353,600,1152,263,90484,5802,14517,19548,2570,3010349,5568,10104,
%U A219188 63513,1022,103713,54018521,29134604,1463,4689,370248451,1799,151190,2118,787
%N A219188 Sum of prime divisors (with repetition) of Lucas(n).
%C A219188 The same as A070827 from a(2) on. - _R. J. Mathar_, Nov 16 2012
%H A219188 Amiram Eldar, <a href="/A219188/b219188.txt">Table of n, a(n) for n = 1..1000</a>
%F A219188 a(n) = A001414(A000032(n)). - _Amiram Eldar_, Sep 05 2019
%e A219188 a(6) = 8 because Lucas(6) = 18 =  2*3^2 and the sum of the prime divisors with repetition is 2 + 2*3 = 8.
%p A219188 A219188 := proc(n)
%p A219188     A001414(A000204(n)) ;
%p A219188 end proc:
%p A219188 seq(A219188(n),n=1..48) ; # _R. J. Mathar_, Nov 16 2012
%t A219188 f[n_] := Plus @@ Times @@@ FactorInteger@ LucasL[n]; f[1] = 0; Array[f, 60]
%Y A219188 Cf. A000204, A001414, A219187.
%K A219188 nonn
%O A219188 1,2
%A A219188 _Michel Lagneau_, Nov 14 2012