The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A179609 a(n)=(5-(-1)^n-6*n)*2^(n-2) 1
 1, 0, -8, -24, -80, -192, -512, -1152, -2816, -6144, -14336, -30720, -69632, -147456, -327680, -688128, -1507328, -3145728, -6815744, -14155776, -30408704, -62914560, -134217728, -276824064, -587202560, -1207959552, -2550136832 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS This sequence belongs to a family of sequences with GF(x) = (1+(k+2)*x+(2*k-4)*x^2)/(1-2*x-(k+8)*x^2-(2*k)*x^3). Among the members of this family are several red king sequences, see A179597. For the sequence given above, which is not a red king sequence, k = -4. LINKS Index entries for linear recurrences with constant coefficients, signature (2, 4, -8). FORMULA GF(x) = (1-2*x-12*x^2)/(1-2*x-4*x^2+8*x^3) a(n) = 2*a(n-1)+4*a(n-2)-8*a(n-3) with a(1)=1, a(2)=0 and a(3)=-8. a(n) = (5-(-1)^n-6*n)*2^(n-2) MATHEMATICA Table[(5-(-1)^n-6n)2^(n-2), {n, 0, 30}] (* or *) LinearRecurrence[{2, 4, -8}, {1, 0, -8}, 30] (* Harvey P. Dale, Mar 25 2021 *) CROSSREFS Sequence in context: A078158 A221906 A116486 * A241690 A141317 A146534 Adjacent sequences:  A179606 A179607 A179608 * A179610 A179611 A179612 KEYWORD easy,sign AUTHOR Johannes W. Meijer, Jul 28 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 26 11:01 EDT 2021. Contains 347665 sequences. (Running on oeis4.)