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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A141752 a(n) = Sum_{k=0..n} ( Fibonacci(2*k-1) + (n-k)*Fibonacci(2*k) ). 1
 1, 2, 5, 14, 39, 106, 283, 748, 1967, 5160, 13521, 35412, 92725, 242774, 635609, 1664066, 4356603, 11405758, 29860687, 78176320, 204668291, 535828572, 1402817445, 3672623784, 9615053929, 25172538026, 65902560173, 172535142518 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Row sums of triangle A141751. LINKS Table of n, a(n) for n=0..27. Index entries for linear recurrences with constant coefficients, signature (5,-8,5,-1). FORMULA G.f.: (1 - 3*x + 3*x^2)/((1 - 3*x + x^2)*(1-x)^2). a(n) = A055588(n) + A054452(n). - R. J. Mathar, Apr 16 2016 a(n) = 5*a(n-1)-8*a(n-2)+5*a(n-3)-a(n-4). - Wesley Ivan Hurt, Oct 18 2021 MATHEMATICA LinearRecurrence[{5, -8, 5, -1}, {1, 2, 5, 14}, 30] (* Harvey P. Dale, May 23 2021 *) PROG (PARI) a(n)=sum(k=0, n, fibonacci(2*k-1) + (n-k)*fibonacci(2*k)) CROSSREFS Cf. A054452, A055588, A141751. Sequence in context: A001011 A148315 A331573 * A291729 A142586 A202207 Adjacent sequences: A141749 A141750 A141751 * A141753 A141754 A141755 KEYWORD nonn,easy AUTHOR Paul D. Hanna, Jul 04 2008 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 7 03:04 EST 2023. Contains 367622 sequences. (Running on oeis4.)