%I #30 Apr 13 2024 14:57:03

%S 0,0,2,3,5,6,13,10,19,16,89,14,233,42,68,57,1597,42,150,60,436,288,

%T 28657,46,3011,754,181,326,514229,114,2974,2264,19892,5168,141979,160,

%U 2443,9499,135956,2228,62158,680,433494437,641,109526,29257,2971215073

%N Sum of primes dividing Fibonacci(n) (with repetition).

%H Amiram Eldar, <a href="/A064725/b064725.txt">Table of n, a(n) for n = 1..1000</a> (terms 1..350 from Harry J. Smith)

%e a(12) = 14 because Fibonacci(12) = 144 = 2^4*3^2 and the sum of the prime divisors with repetition is 4*2 + 2*3 = 14.

%p with (numtheory):with(combinat, fibonacci):

%p sopfr:= proc(n) local e, j; e := ifactors(fibonacci(n))[2]:

%p add (e[j][1]*e[j][2], j=1..nops(e)) end:

%p seq (sopfr(n), n=1..100); # _Michel Lagneau_, Nov 13 2012

%p # second Maple program:

%p a:= n-> add(i[1]*i[2], i=ifactors((<<0|1>, <1|1>>^n)[1, 2])[2]):

%p seq(a(n), n=1..47); # _Alois P. Heinz_, Sep 03 2019

%t fiboPrimeFactorSum[n_] := Plus @@ Times @@@ FactorInteger@ Fibonacci[n]; fiboPrimeFactorSum[1] = 0; Array[fiboPrimeFactorSum, 60] (* _Michel Lagneau_, Nov 13 2012 *)

%o (PARI) sopfr(n)= { local(f,s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]*f[i, 2]); return(s) }

%o { for (n = 0, 350, write("b064725.txt", n, " ", sopfr(fibonacci(n))) ) } \\ _Harry J. Smith_, Sep 23 2009

%Y Cf. A000045, A001414, A080648 (without repetition).

%K nonn

%O 1,3

%A _Jason Earls_, Oct 16 2001