OFFSET
0,3
LINKS
Bruno Berselli, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,-4,-10,10,4,-5,1).
FORMULA
O.g.f.: x*(1 - 2*x + 4*x^2 - 2*x^3 + x^4)/((1 - x)*(1 + x)^2*(1 - 3*x + x^2)^2).
a(n) = 5*a(n-1) - 4*a(n-2) - 10*a(n-3) + 10*a(n-4) + 4*a(n-5) - 5*a(n-6) + a(n-7).
a(n) = ((n-1)*Fibonacci(n) + n*Fibonacci(n-1))*Fibonacci(n) + (1 - (-1)^n)/2.
MAPLE
with(combinat): P:=proc(q) local a, n; a:=0; print(a); for n from 1 to q do
a:=a+n*fibonacci(n)^2; print(a); od; end: P(100); # Paolo P. Lava, Feb 17 2017
MATHEMATICA
a[n_] := Sum[i*Fibonacci[i]^2, {i, 0, n}]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Feb 16 2017 *)
LinearRecurrence[{5, -4, -10, 10, 4, -5, 1}, {0, 1, 3, 15, 51, 176, 560}, 30] (* Harvey P. Dale, May 15 2021 *)
PROG
(PARI) a(n) = sum(i=0, n, i*fibonacci(i)^2) \\ Colin Barker, Feb 16 2017
(Sage) [sum(i*fibonacci(i)^2 for i in [0..n]) for n in range(30)]
(Maxima) makelist(sum(i*fib(i)^2, i, 0, n), n, 0, 30)
(Magma) [&+[i*Fibonacci(i)^2: i in [0..n]]: n in [0..30]];
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Bruno Berselli, Feb 16 2017
STATUS
approved