The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A087438 a(n) = 3*2^(2*(n-1)) + 2^(n-2)*(n+1). 1
 1, 4, 15, 56, 212, 816, 3184, 12544, 49728, 197888, 789248, 3151872, 12596224, 50360320, 201388032, 805437440, 3221504000, 12885491712, 51540852736, 206161051648, 824639225856, 3298546417664, 13194163650560, 52776608464896 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Binomial transform of A047926. LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..500 Index entries for linear recurrences with constant coefficients, signature (8,-20,16). FORMULA G.f.: (1 - 4*x + 3*x^2)/((1-2*x)^2*(1-4*x)). E.g.f.: (3*exp(4*x) + (1+2*x)*exp(2*x))/4. a(n) = 8*a(n-1) - 20*a(n-2) + 16*a(n-3); a(0)=1, a(1)=4, a(2)=15. - Harvey P. Dale, May 20 2011 MATHEMATICA LinearRecurrence[{8, -20, 16}, {1, 4, 15}, 30] (* or *) CoefficientList[ Series[ (1-4x+3x^2)/((1-2x)^2(1-4x)), {x, 0, 30}], x] (* Harvey P. Dale, May 20 2011 *) PROG (MAGMA) [3*2^(2*(n-1))+2^(n-2)*(n+1): n in [0..25]]; // Vincenzo Librandi, May 21 2011 CROSSREFS Sequence in context: A158500 A001791 A047128 * A131497 A174958 A244824 Adjacent sequences:  A087435 A087436 A087437 * A087439 A087440 A087441 KEYWORD easy,nonn AUTHOR Paul Barry, Sep 03 2003 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 November 24 07:33 EST 2020. Contains 338607 sequences. (Running on oeis4.)