login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141752 a(n) = Sum_{k=0..n} [ Fibonacci(2k-1) + (n-k)*Fibonacci(2k) ]. 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

LINKS

Table of n, a(n) for n=0..27.

Index entries for linear recurrences with constant coefficients, signature (5,-8,5,-1).

FORMULA

Row sums of triangle A141751.

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

PROG

(PARI) a(n)=sum(k=0, n, fibonacci(2*k-1) + (n-k)*fibonacci(2*k))

CROSSREFS

Cf. A141751.

Sequence in context: A148314 A001011 A148315 * A142586 A202207 A132834

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 10:46 EST 2016. Contains 278699 sequences.