[go: up one dir, main page]

login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A282464 revision #19

A282464
a(n) = Sum_{i=0..n} i*Fibonacci(i)^2.
4
0, 1, 3, 15, 51, 176, 560, 1743, 5271, 15675, 45925, 133056, 381888, 1087645, 3077451, 8658951, 24245655, 67602608, 187789616, 519924075, 1435228575, 3951341811, 10852291273, 29740435200, 81340229376, 222058995001, 605201766675, 1646862596223, 4474969884411
OFFSET
0,3
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 *)
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 xrange(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
Cf. A000045.
Partial sums of A169630.
Cf. A014286: partial sums of i*Fibonacci(i).
Cf. A064831: partial sums of (n+1-i)*Fibonacci(i)^2.
Sequence in context: A165746 A248122 A118126 * A284663 A231747 A192742
KEYWORD
nonn,easy
AUTHOR
Bruno Berselli, Feb 16 2017
STATUS
reviewed