cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A089061 a(0) = 5, a(1) = 7; for n>1, a(n) = a(n-1)+a(n-2)-(2n-2).

Original entry on oeis.org

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

Views

Author

Kurmang. Aziz. Rashid, Dec 02 2003

Keywords

Crossrefs

Programs

  • 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 *)

Formula

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