A166025 a(0) = 6, a(1) = 17, a(n+1) = a(n) + a(n-1) for n>0.

6, 17, 23, 40, 63, 103, 166, 269, 435, 704, 1139, 1843, 2982, 4825, 7807, 12632, 20439, 33071, 53510, 86581, 140091, 226672, 366763, 593435, 960198, 1553633, 2513831, 4067464, 6581295, 10648759, 17230054, 27878813, 45108867, 72987680, 118096547

Offset: 0

Author

Akshay Verma (11akshayV(AT)nist.ac.th), Oct 04 2009

Keywords

• nonn

Links

• G. C. Greubel, Table of n, a(n) for n = 0..1000
• Index entries for linear recurrences with constant coefficients, signature (1,1)

Programs

Mathematica

Join[{a=6,b=17},Table[c=a+b;a=b;b=c,{n,60}]] (* Vladimir Joseph Stephan Orlovsky, Feb 28 2011 *)
Join[{6}, LinearRecurrence[{1, 1}, {17, 23}, 100]] (* G. C. Greubel, Apr 21 2016 *)

Formula

G.f.: (6+11x)/(1-x-x^2). - Philippe Deléham, Oct 06 2009

a(n) = 6*A000045(n+1) + 11*A000045(n). - R. J. Mathar, Oct 06 2009

a(n) = Fibonacci(n+6) + Fibonacci(n+2) + Fibonacci(n-4). - Greg Dresden, Feb 18 2022

Extensions

Edited by N. J. A. Sloane, Oct 05 2009