login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089061 a(0) = 5, a(1) = 7; for n>1, a(n) = a(n-1)+a(n-2)-(2n-2). 0
5, 7, 10, 13, 17, 22, 29, 39, 54, 77, 113, 170, 261, 407, 642, 1021, 1633, 2622, 4221, 6807, 10990, 17757, 28705, 46418, 75077, 121447, 196474, 317869, 514289, 832102, 1346333, 2178375, 3524646, 5702957, 9227537, 14930426, 24157893 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..36.

Index entries for linear recurrences with constant coefficients, signature (3,-2,-1,1).

FORMULA

a(n) = Fibonacci(n+1)+2n+4. - Ralf Stephan, Feb 24 2004

MATHEMATICA

RecurrenceTable[{a[0]==5, a[1]==7, a[n]==a[n-1]+a[n-2]-(2n-2)}, a, {n, 40}] (* or *) LinearRecurrence[{3, -2, -1, 1}, {5, 7, 10, 13}, 40] (* Harvey P. Dale, Apr 23 2018 *)

CROSSREFS

Cf. A088981, A000045.

Sequence in context: A287444 A196175 A112251 * A093115 A020936 A025074

Adjacent sequences:  A089058 A089059 A089060 * A089062 A089063 A089064

KEYWORD

nonn

AUTHOR

Kurmang. Aziz. Rashid, Dec 02 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 21:04 EST 2018. Contains 317331 sequences. (Running on oeis4.)