This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119306 Expansion of (1-4*x)/(1-x*(1-x)^3). 2
 1, -3, -6, 6, 14, -19, -37, 56, 96, -164, -247, 477, 630, -1378, -1590, 3957, 3963, -11300, -9728, 32104, 23425, -90771, -55006, 255478, 124758, -715923, -268757, 1997808, 531552, -5552220, -884695, 15368813, 834686, -42373618, 2113458, 116369557, -17926357 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Row sums of number triangle A119305. LINKS Indranil Ghosh, Table of n, a(n) for n = 0..4534 Index entries for linear recurrences with constant coefficients, signature (1,-3,3,-1). FORMULA G.f.: (1 - 4*x)/(1 - x + 3*x^2 - 3*x^3 + x^4). a(n) = a(n-1) - 3*a(n-2) + 3*a(n-3) - a(n-4). a(n) = Sum_{k=0..n} (C(3*k,n-k) + 4*C(3*k,n-k-1))*(-1)^(n-k). MATHEMATICA CoefficientList[Series[(1 - 4 x)/(1 - x (1 - x)^3), {x, 0, 36}], x] (* or *) LinearRecurrence[{1, -3, 3, -1}, {1, -3, -6, 6}, 37] (* or *) Table[Sum[(Binomial[3 k, n - k] + 4 Binomial[3 k, n - k - 1]) (-1)^(n - k), {k, 0, n}], {n, 0, 36}] (* Indranil Ghosh, Feb 27 2017 *) PROG (PARI) a(n) = sum(k=0, n, (binomial(3*k, n-k)+4*binomial(3*k, n-k-1))*(-1)^(n-k)); \\ Indranil Ghosh, Feb 27 2017 CROSSREFS Sequence in context: A202931 A240250 A239424 * A107972 A238775 A269525 Adjacent sequences:  A119303 A119304 A119305 * A119307 A119308 A119309 KEYWORD sign,easy AUTHOR Paul Barry, May 13 2006 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 December 13 06:26 EST 2019. Contains 329968 sequences. (Running on oeis4.)