The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A133209 a(n) = 4a(n-1) - 6a(n-2) + 4a(n-3), n > 3; a(0) = 3, a(1) = 2, a(2) = a(3) = 0. 1
 3, 2, 0, 0, 8, 32, 80, 160, 288, 512, 960, 1920, 3968, 8192, 16640, 33280, 66048, 131072, 261120, 522240, 1046528, 2097152, 4198400, 8396800, 16785408, 33554432, 67092480, 134184960, 268402688, 536870912, 1073807360, 2147614720 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Table of n, a(n) for n=0..31. Index entries for linear recurrences with constant coefficients, signature (4, -6, 4). FORMULA Sequence is identical to its fourth differences. a(n) = 2^n + 2^[(n+3)/2]*cos((n+1)Pi/4); a(n)=2^n + (1+i)^(n+1) + (1-i)^(n+1), where i=sqrt(-1). - Emeric Deutsch, Oct 14 2007 G.f.: -(3-10*x+10*x^2)/(2*x-1)/(2*x^2-2*x+1). - R. J. Mathar, Nov 14 2007 MAPLE a[0]:=3: a[1]:=2: a[2]:=0: a[3]:=0; for n from 4 to 27 do a[n]:=4*a[n-1]-6*a[n-2]+4*a[n-3] end do: seq(a[n], n=0..27); # Emeric Deutsch, Oct 14 2007 MATHEMATICA a = {3, 2, 0, 0}; Do[AppendTo[a, 4*a[[ -1]] - 6*a[[ -2]] + 4*a[[ -3]]], {30}]; a (* Stefan Steinerberger, Oct 14 2007 *) LinearRecurrence[{4, -6, 4}, {3, 2, 0}, 32] (* Ray Chandler, Sep 23 2015 *) CROSSREFS Cf. A131470, A009116, A099087. Sequence in context: A240659 A246159 A059033 * A144553 A187130 A187145 Adjacent sequences: A133206 A133207 A133208 * A133210 A133211 A133212 KEYWORD nonn,easy AUTHOR Paul Curtz, Oct 11 2007 EXTENSIONS More terms from Stefan Steinerberger and Emeric Deutsch, Oct 14 2007 STATUS approved

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

Last modified June 6 14:05 EDT 2023. Contains 363147 sequences. (Running on oeis4.)