%I A013655
%S A013655 3,2,5,7,12,19,31,50,81,131,212,343,555,898,1453,2351,3804,6155,9959,
%T A013655 16114,26073,42187,68260,110447,178707,289154,467861,757015,1224876,
%U A013655 1981891,3206767,5188658,8395425,13584083,21979508,35563591,57543099
%N A013655 F(n)+L(n), where F(n) and L(n) are Fibonacci and Lucas numbers respectively.
%H A013655 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%H A013655 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A013655 a(n)=a(n-1)+a(n-2).
%F A013655 For n > 1, a(n) = F(n+3) - F(n-2) (Fibonacci numbers, A000045) - Gerald 
               McGarvey (Gerald.McGarvey(AT)comcast.net), Jul 10 2004
%F A013655 a(n)=2*fibonacci(n-3)+fibonacci(n), n>=2 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Oct 05 2007
%F A013655 G.f.: (3-x)/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Nov 19 2008]
%p A013655 with(combinat):a:=n->2*fibonacci(n-3)+fibonacci(n): seq(a(n), n=2..38); 
               - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
%t A013655 lst={};Do[AppendTo[lst,Fibonacci[n+5]-Fibonacci[n]],{n,-2,4*4!}];lst 
               [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jun 11 2009]
%Y A013655 Apart from initial term, same as A001060.
%Y A013655 Sequence in context: A082334 A151749 A110338 this_sequence A094894 A089334 
               A016649
%Y A013655 Adjacent sequences: A013652 A013653 A013654 this_sequence A013656 A013657 
               A013658
%K A013655 nonn,easy
%O A013655 0,1
%A A013655 Mohammad K. Azarian (ma3(AT)evansville.edu)
%E A013655 More terms from Erich Friedman (erich.friedman(AT)stetson.edu).