The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A200408

a(n) = -4 + 5*Fibonacci(n+1)^2.
(history; published version)

#24 by Ray Chandler at Tue Mar 12 12:54:56 EDT 2024

STATUS

editing

approved

#23 by Ray Chandler at Tue Mar 12 12:54:51 EDT 2024

LINKS

<a href="/index/Rec#order_0204">Index entries for linear recurrences with constant coefficients</a>, signature (3,0,-3,1).

STATUS

approved

editing

#22 by Alois P. Heinz at Mon Mar 11 11:27:53 EDT 2024

STATUS

editing

approved

#21 by Alois P. Heinz at Mon Mar 11 11:26:13 EDT 2024

FORMULA

a(n) = 3*a(n-1)-3*a(n-3)+a(n-4). G.f.: 1-x*(x^3-7*x^2+13*x+1) / ((x-1)*(x+1)*(x^2-3*x+1)). - Colin Barker, Sep 01 2013

#20 by Alois P. Heinz at Mon Mar 11 11:24:39 EDT 2024

DATA

1, 1, 16, 41, 121, 316, 841, 2201, 5776, 15121, 39601, 103676, 271441, 710641, 1860496, 4870841, 12752041, 33385276, 87403801, 228826121, 599074576, 1568397601, 4106118241, 10749957116, 28143753121, 73681302241, 192900153616, 505019158601, 1322157322201

OFFSET

1,2

0,3

EXTENSIONS

a(0)=1 prepended by Alois P. Heinz, Mar 11 2024

STATUS

proposed

editing

#19 by Michel Marcus at Mon Mar 11 11:11:18 EDT 2024

STATUS

editing

proposed

#18 by Michel Marcus at Mon Mar 11 11:10:53 EDT 2024

NAME

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

LINKS

<a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,0,-3,1).

STATUS

approved

editing

#17 by R. J. Mathar at Mon Jan 18 08:24:34 EST 2021

STATUS

editing

approved

#16 by R. J. Mathar at Mon Jan 18 08:24:29 EST 2021

CROSSREFS

Cf. A000045A005248.

#15 by R. J. Mathar at Mon Jan 18 08:23:45 EST 2021

FORMULA

a(n) = A005248(n+1) - A010696(n). - R. J. Mathar, Jan 18 2021

STATUS

approved

editing