The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A110527

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

A110527

a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 0, a(1) = 1, a(2) = 8.
(history; published version)

#27 by N. J. A. Sloane at Sat May 25 15:33:20 EDT 2024

STATUS

proposed

approved

#26 by Greg Dresden at Sat May 25 14:38:22 EDT 2024

STATUS

editing

proposed

#25 by Greg Dresden at Sat May 25 14:38:09 EDT 2024

FORMULA

a(n) = (-1)^n + 2*A110526(n) + A110679(n-2) for n >= 2. - _Yomna Bakr and _Greg Dresden_, May 25 2024

#24 by Greg Dresden at Sat May 25 14:37:40 EDT 2024

FORMULA

a(n) = (-1)^n + 2*A110526(n) + A110679(n-2) for n >= 2. - Greg Dresden, May 25 2024

STATUS

approved

editing

#23 by Joerg Arndt at Mon Jan 01 11:37:41 EST 2024

STATUS

editing

approved

#22 by Paolo P. Lava at Mon Jan 01 11:36:10 EST 2024

FORMULA

a(n) = -(1/2)*(2 - sqrt(5))^n + (-1)^n - (1/2)*(2 + sqrt(5))^n + (2/5)*(2 + sqrt(5))^n*sqrt(5) - (2/5)*(2 - sqrt(5))^n*sqrt(5), with n >= 0. - Paolo P. Lava, Oct 02 2008

STATUS

approved

editing

#21 by R. J. Mathar at Sun Oct 03 08:17:55 EDT 2021

STATUS

editing

approved

#20 by R. J. Mathar at Sun Oct 03 08:17:47 EDT 2021

FORMULA

a(n) = (-1)^n + 3*FibonacciA001076(3*n)/2 - FibonacciA015448(3*n - 1). - Ehren Metcalfe, Nov 18 2017

STATUS

approved

editing

#19 by Michel Marcus at Sun Nov 19 04:01:06 EST 2017

STATUS

reviewed

approved

#18 by Joerg Arndt at Sun Nov 19 02:12:44 EST 2017

STATUS

proposed

reviewed