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 A135968 #15 Oct 13 2024 07:08:07
%S A135968 0,150,2974,2443,62158,55946694,2710261050,555008010,1547031,
%T A135968 46165377746,95396546,92180471494910,1665088321801550,364125780,
%U A135968 771601497990,518283023,8242065051309594,32530503217194,272602401466814027806,5568053048227732238014,85526725052226871
%N A135968 Sum of the distinct prime factors of the Fibonacci number A050937(n).
%H A135968 Amiram Eldar, <a href="/A135968/b135968.txt">Table of n, a(n) for n = 1..203</a>
%F A135968 a(n) = A008472(A050937(n)). - _R. J. Mathar_, Dec 12 2007
%e A135968 a(2) = 150 = 37+113 because A050937(2) = 4181 = 37*113.
%e A135968 a(3) = 2974 = 557 + 2417 because A050937(3) = 1346269 = 557*2417.
%t A135968 k = {}; Do[If[ ! PrimeQ[Fibonacci[Prime[n]]], b = FactorInteger[Fibonacci[Prime[n]]]; c =Length[FactorInteger[b]]; d = 0; Do[d = d + b[[r]][[1]], {r, 1, c}]; AppendTo[k, d]], {n, 1, 50}]; k
%Y A135968 Cf. A000045, A001605, A008472, A050937, A075737, A090819, A134787, A134851, A134852, A135953, A135954, A135955, A135956, A135957, A135958, A135959, A135969.
%K A135968 nonn
%O A135968 1,2
%A A135968 _Artur Jasinski_, Dec 09 2007
%E A135968 Edited by _R. J. Mathar_, Dec 12 2007
%E A135968 a(19)-a(21) from _Amiram Eldar_, Oct 13 2024