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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A154327 Diagonal sums of number triangle A132046. 2
 1, 1, 2, 5, 8, 15, 24, 41, 66, 109, 176, 287, 464, 753, 1218, 1973, 3192, 5167, 8360, 13529, 21890, 35421, 57312, 92735, 150048, 242785, 392834, 635621, 1028456, 1664079, 2692536, 4356617, 7049154, 11405773, 18454928, 29860703, 48315632, 78176337, 126491970, 204668309, 331160280, 535828591, 866988872 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (1,2,-1,-1). FORMULA G.f.: (1 - x^2 + 2x^3 + x^4)/( (1-x^2)*(1-x-x^2) ). a(n) = 0^n - (3 + (-1)^n)/2 + 2*Fibonacci(n+1). MATHEMATICA Join[{1}, LinearRecurrence[{1, 2, -1, -1}, {1, 2, 5, 8}, 25]] (* G. C. Greubel, Sep 11 2016 *) CoefficientList[Series[(1 - x^2 + 2 x^3 + x^4) / ((1 - x^2) (1 - x - x^2)), {x, 0, 50}], x] (* Vincenzo Librandi, Sep 12 2016 *) PROG (Magma) [0^n-(3+(-1)^n)/2+2*Fibonacci(n+1):n in [0..40]]; // Vincenzo Librandi, Sep 12 2016 CROSSREFS Cf. A066629. Sequence in context: A066897 A078697 A066629 * A074027 A018156 A051293 Adjacent sequences: A154324 A154325 A154326 * A154328 A154329 A154330 KEYWORD easy,nonn AUTHOR Paul Barry, Jan 07 2009 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 December 3 11:54 EST 2022. Contains 358521 sequences. (Running on oeis4.)