The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A282464 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A282464

a(n) = Sum_{i=0..n} i*Fibonacci(i)^2.
(history; published version)

#26 by Charles R Greathouse IV at Thu Sep 08 08:46:18 EDT 2022

PROG

(MAGMAMagma) [&+[i*Fibonacci(i)^2: i in [0..n]]: n in [0..30]];

Discussion

Thu Sep 08

08:46

OEIS Server: https://oeis.org/edit/global/2944

#25 by Harvey P. Dale at Sat May 15 16:44:16 EDT 2021

STATUS

editing

approved

#24 by Harvey P. Dale at Sat May 15 16:44:13 EDT 2021

MATHEMATICA

LinearRecurrence[{5, -4, -10, 10, 4, -5, 1}, {0, 1, 3, 15, 51, 176, 560}, 30] (* Harvey P. Dale, May 15 2021 *)

STATUS

approved

editing

#23 by N. J. A. Sloane at Sat Dec 07 12:18:28 EST 2019

PROG

(Sage) [sum(i*fibonacci(i)^2 for i in [0..n]) for n in xrangerange(30)]

Discussion

Sat Dec 07

12:18

OEIS Server: https://oeis.org/edit/global/2837

#22 by Bruno Berselli at Mon Feb 20 03:02:04 EST 2017

STATUS

editing

approved

#21 by Bruno Berselli at Mon Feb 20 03:01:59 EST 2017

LINKS

Bruno Berselli, <a href="/A282464/b282464.txt">Table of n, a(n) for n = 0..1000</a>

STATUS

approved

editing

#20 by Michel Marcus at Sat Feb 18 10:35:22 EST 2017

STATUS

reviewed

approved

#19 by Joerg Arndt at Fri Feb 17 05:17:27 EST 2017

STATUS

proposed

reviewed

#18 by Bruno Berselli at Fri Feb 17 05:16:27 EST 2017

STATUS

editing

proposed

#17 by Bruno Berselli at Fri Feb 17 05:16:22 EST 2017

FORMULA

a(n) = ((n-1)*Fibonacci(n)*( + n*Fibonacci(n+-1) - )*Fibonacci(n)) + (1 - (-1)^n)/2.

STATUS

proposed

editing