This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167616 a(n) = Fibonacci(n) - 5. 16
 0, 3, 8, 16, 29, 50, 84, 139, 228, 372, 605, 982, 1592, 2579, 4176, 6760, 10941, 17706, 28652, 46363, 75020, 121388, 196413, 317806, 514224, 832035, 1346264, 2178304, 3524573, 5702882, 9227460, 14930347, 24157812, 39088164, 63245981, 102334150 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,2 LINKS G. C. Greubel, Table of n, a(n) for n = 5..1000 Index entries for linear recurrences with constant coefficients, signature (2, 0, -1). FORMULA a(n) = a(n-1) + a(n-2) + 5. - Zak Seidov, Jun 27 2010 a(5)=0, a(6)=3, a(7)=8, a(n) = 2*a(n-1) - a(n-3). - Harvey P. Dale, Dec 31 2011 G.f.: x^6*(3+2*x)/((1-x)(1-x-x^2)). - L. Edson Jeffery, Mar 17 2013 MATHEMATICA Fibonacci[Range[5, 40]]-5 (* or *) LinearRecurrence[{2, 0, -1}, {0, 3, 8}, 40] (* Harvey P. Dale, Dec 31 2011 *) PROG (MAGMA) [(Fibonacci(n) - 5): n in [5..55]]; // Vincenzo Librandi, Apr 23 2011 (PARI) a(n)=fibonacci(n)-5 \\ Charles R Greathouse IV, Jul 01 2013 CROSSREFS Cf. A000045, A001611, A000071, A157725, A001911, A157726, A006327, A157727, A157728, A157729, A167616. Sequence in context: A131941 A009858 A169947 * A009439 A000233 A002624 Adjacent sequences:  A167613 A167614 A167615 * A167617 A167618 A167619 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Jun 26 2010 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.

Last modified October 23 22:04 EDT 2018. Contains 316541 sequences. (Running on oeis4.)