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 A287273 #6 May 28 2017 09:47:54
%S A287273 6,10,19,16,24,42,71,68,106,150,178,447,288,431,3026,754,1119,1220,
%T A287273 1902,2974,3194,19979,5168,142026,7728,13098,13530,136187,20276,62158,
%U A287273 34130,52994,119811,92736,138673,6169970,241310,6379215,392836,55946694,587943,768686
%N A287273 Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1*d2 = d3*d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}.
%C A287273 This sequence is included in A273227.
%C A287273 The primes of the sequence are 19, 71, 431, 19979,...
%e A287273 a(5) = 24 because A090206(8) = 144 = 1*144 = 2*72 = 3*48 = 4*36 = 6*24 = 8*18 = 9*16 = 12*12 and the minimum sum of {145, 74, 51, 40, 30, 26, 25, 24} is 24.
%t A287273 Function[n, Min@ Map[# + n/# &, Take[#, Ceiling[Length[#]/2]]] &@ Divisors@ n] /@ Select[Fibonacci@ Range@ 55, CompositeQ] (* _Michael De Vlieger_, May 24 2017 *)
%o A287273 (PARI) for(n=1, 100, d=divisors(fibonacci(n)); t=#d; k=if(t%2, 2*d[t\2+1], d[t\2]+d[t\2+1]); print1(k", ")).
%Y A287273 Cf. A000045, A002808, A090206, A273227.
%K A287273 nonn
%O A287273 1,1
%A A287273 _Michel Lagneau_, May 22 2017