%I A118658
%S A118658 2,0,2,2,4,6,10,16,26,42,68,110,178,288,466,754,1220,1974,3194,5168,
%T A118658 8362,13530,21892,35422,57314,92736,150050,242786,392836,635622,1028458,
%U A118658 1664080,2692538,4356618,7049156,11405774,18454930,29860704,48315634
%N A118658 L_n - F_n where L_n is the Lucas Number and F_n is the Fibonacci Number.
%C A118658 Essentially the same as A006355, A047992, A054886, A055389, A068922,
A090991, - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 20 2006
%H A118658 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
RecursiveSequences.html">Recursive Sequences</a>
%F A118658 a(0)=2, a(1)=0, a(n)=a(n-1)+a(n-2)for n>1 . G.f. (2-2*x)/(1-x-x^2) .
a(0)=2 and a(n)= 2*A000045(n-1) for n>0 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr),
Sep 20 2006
%F A118658 a(n)=F(n)+F(n+3) n>=-3 {where F(n) is the n-th Fibonacci number} - Zerinvary
Lajos (zerinvarylajos(AT)yahoo.com), Jan 31 2008
%F A118658 Closed form. a(n)=[(1/2)+(1/2)*sqrt(5)]^n-(1/5*[(1/2)+(1/2)*sqrt(5)]^n*sqrt(5)+(1/
5)*sqrt(5)*[(1/2)-(1/2) *sqrt(5)]^n+[(1/2)-(1/2)*sqrt(5)]^n, with
n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Nov 19 2008]
%e A118658 L_7 = 18, F_7 = 8, L_7 - F_7 = 10
%p A118658 BB := n->if n=0 then 2; > elif n=1 then 0; > else BB(n-2)+BB(n-1); >
fi: > L:=[]: for k from 0 to 38 do L:=[op(L),BB(k)]: od: L; - Zerinvary
Lajos (zerinvarylajos(AT)yahoo.com), Mar 19 2007
%p A118658 with(combinat): seq(fibonacci(n)+fibonacci(n+3), n=-3..35); - Zerinvary
Lajos (zerinvarylajos(AT)yahoo.com), Jan 31 2008
%Y A118658 Cf. A000032, A003714.
%Y A118658 Sequence in context: A157898 A137430 A002121 this_sequence A165912 A071055
A078052
%Y A118658 Adjacent sequences: A118655 A118656 A118657 this_sequence A118659 A118660
A118661
%K A118658 easy,nonn
%O A118658 0,1
%A A118658 Bill Jones (b92057(AT)yahoo.com), May 18 2006
%E A118658 More terms from Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 20 2006
%E A118658 Corrected by T. D. Noe (noe(AT)sspectra.com), Nov 01 2006
|