%I A098150
%S A098150 3,11,30,79,207,542,1419,3715,9726,25463,66663,174526,456915,1196219,
%T A098150 3131742,8199007,21465279,56196830,147125211,385178803,1008411198,
%U A098150 2640054791,6911753175,18095204734,47373861027,124026378347
%V A098150 -3,11,-30,79,-207,542,-1419,3715,-9726,25463,-66663,174526,-456915,1196219,
-3131742,
%W A098150 8199007,-21465279,56196830,-147125211,385178803,-1008411198,2640054791,
-6911753175,
%X A098150 18095204734,-47373861027,124026378347
%N A098150 a(n) = 2(a(n-2) - a(n-1)) + a(n-3) where a(0)=-3, a(1)=11 & a(2)=-30.
%C A098150 Sequence relates bisections of Lucas and Fibonacci numbers.
%C A098150 2*A098149(n) + a(n) = 8*(-1)^(n+1)*A001519(n) - (-1)^(n+1)*A005248(n+1).
%H A098150 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to
linear recurrences with constant coefficients</a>
%H A098150 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
RecursiveSequences.html">Recursive Sequences</a>
%F A098150 a(n) = - 3a(n-1) - a(n-2). - Tanya Khovanova (tanyakh(AT)yahoo.com),
Feb 02 2007
%F A098150 G.f.: (2x-3)/(1+3x+x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr),
Nov 16 2008]
%F A098150 a(n)=-(3/2)*[(-3/2)-(1/2)*sqrt(5)]^n-(13/10)*[(-3/2)-(1/2)*sqrt(5)]^n*sqrt(5)+(13/
10)*[(-3/2)+(1/2) *sqrt(5)]^n*sqrt(5)-(3/2)*[(-3/2)+(1/2)*sqrt(5)]^n,
with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Nov 19 2008]
%t A098150 a[0] = -3; a[1] = 11; a[2] = -30; a[n_] := a[n] = 2(a[n - 2] - a[n -
1]) + a[n - 3]; Table[ a[n], {n, 0, 25}] (from Robert G. Wilson v
Sep 04 2004)
%Y A098150 Cf. A098149, A001519, A005248.
%Y A098150 Sequence in context: A009183 A165893 A106397 this_sequence A167375 A085376
A009131
%Y A098150 Adjacent sequences: A098147 A098148 A098149 this_sequence A098151 A098152
A098153
%K A098150 easy,sign
%O A098150 0,1
%A A098150 Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 29 2004
%E A098150 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 04 2004
|