The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A163198

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

A163198

Sum of the cubes of the first n even-indexed Fibonacci numbers.
(history; published version)

#36 by Peter Luschny at Mon Oct 07 03:23:00 EDT 2024

STATUS

reviewed

approved

#35 by Joerg Arndt at Mon Oct 07 02:34:04 EDT 2024

STATUS

proposed

reviewed

#34 by Michel Marcus at Mon Oct 07 01:49:29 EDT 2024

STATUS

editing

proposed

#33 by Michel Marcus at Mon Oct 07 01:49:26 EDT 2024

FORMULA

a(n) = (F(2*n+1)-1)^2*(F(2*n+1) + 2)/4, n>=0. See the Melham reference for a general conjecture. - Wolfdieter Lang, Aug 10 2012.

STATUS

proposed

editing

#32 by Jason Yuen at Mon Oct 07 01:31:55 EDT 2024

STATUS

editing

proposed

#31 by Jason Yuen at Mon Oct 07 01:31:48 EDT 2024

LINKS

H. Prodinger, <a href="http://www.fq.math.ca/Papers1/46_47-3/Prodinger.pdf">On a sum of Melham and its variants</a>, The Fibonacci Quart. 46/47 (2008/2009), no. 3, 207-215.

STATUS

approved

editing

#30 by Harvey P. Dale at Wed Nov 15 18:05:54 EST 2023

STATUS

editing

approved

#29 by Harvey P. Dale at Wed Nov 15 18:05:51 EST 2023

MATHEMATICA

Accumulate[Fibonacci[Range[0, 40, 2]]^3] (* Harvey P. Dale, Nov 15 2023 *)

STATUS

approved

editing

#28 by Joerg Arndt at Sat Dec 10 03:23:44 EST 2016

STATUS

proposed

approved

#27 by G. C. Greubel at Fri Dec 09 13:42:02 EST 2016

STATUS

editing

proposed