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 A280106 #22 Mar 02 2017 23:06:34 %S A280106 3,6,8,10,14,15,22,26,30,34,94 %N A280106 Numbers k such that the half sum of the prime factors of Fibonacci(k) is a Fibonacci number. %C A280106 Or numbers k such that A080648(k)/2 is a Fibonacci number. %C A280106 Is this sequence finite ? %C A280106 a(12), if it exists is >5000. - _Robert Price_, Mar 02 2017 %e A280106 10 is in the sequence because Fibonacci(10) = 5*11=> 5+11 = 2*8 = 2*F(6); %e A280106 94 is in the sequence because Fibonacci(94) = 2971215073*6643838879 => %e A280106 2971215073+6643838879 = 2*4807526976 = 2*F(48). %p A280106 with(numtheory):with(combinat,fibonacci):nn:=300: %p A280106 for n from 3 to nn do: %p A280106 f:=fibonacci(n):x:=factorset(f):n0:=nops(x): %p A280106 s:=sum(‘x[i]’, ‘i’=1..n0):c:=s/2: %p A280106 x1:=sqrt(5*c^2-4):x2:=sqrt(5*c^2+4): %p A280106 if x1=floor(x1) or x2=floor(x2) %p A280106 then %p A280106 print(n): %p A280106 else %p A280106 fi: %p A280106 od: %Y A280106 Cf. A000045, A080648. %K A280106 nonn,more %O A280106 1,1 %A A280106 _Michel Lagneau_, Dec 28 2016