%I A059389
%S A059389 2,3,4,5,6,7,8,9,10,11,13,14,15,16,18,21,22,23,24,26,29,34,35,36,37,39,
%T A059389 42,47,55,56,57,58,60,63,68,76,89,90,91,92,94,97,102,110,123,144,145,
%U A059389 146,147,149,152,157,165,178,199,233,234,235,236,238,241,246,254,267
%N A059389 Sums of two nonzero Fibonacci numbers.
%C A059389 The sequence: sums of two distinct nonzero Fibonacci numbers is essentially 
               the same sequence, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 18, 
               21, .. (only 2 is missing), since F(i) + F(i) = F(i-2) + F(i+1). 
               - Colm Mulcahy (colm(AT)spelman.edu), Mar 02 2008
%H A059389 T. D. Noe, <a href="b059389.txt">Table of n, a(n) for n=1..1000</a>
%F A059389 a(1) = 2 and for n >= 2 a(n) = F_(trinv(n-2)+2) + F_(n-((trinv(n-2)*(trinv(n-2)-1))/
               2)) where F_n is the n-th Fibonacci number, F_1 = 1 F_2 = 1 F_3 = 
               2 ... and the definition of trinv(n) is in A002262. - Noam Katz (noamkj(AT)hotmail.com), 
               Feb 04 2001
%e A059389 a(10) = 11 because 11 = 8 + 3
%Y A059389 Cf. A000045, A059390 (complement). Similar in nature to A048645. Essentially 
               the same as A084176.
%Y A059389 Sequence in context: A085156 A102466 A084176 this_sequence A064683 A084384 
               A119885
%Y A059389 Adjacent sequences: A059386 A059387 A059388 this_sequence A059390 A059391 
               A059392
%K A059389 nonn,easy
%O A059389 1,1
%A A059389 Avi Peretz (njk(AT)netvision.net.il), Jan 29 2001
%E A059389 More terms from Larry Reeves (larryr(AT)acm.org), Jan 31 2001