login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,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
Sequence in context: A287444 A196175 A112251 * A093115 A020936 A025074
KEYWORD
nonn
AUTHOR
STATUS
approved