A022117 Fibonacci sequence beginning 2, 15.

2, 15, 17, 32, 49, 81, 130, 211, 341, 552, 893, 1445, 2338, 3783, 6121, 9904, 16025, 25929, 41954, 67883, 109837, 177720, 287557, 465277, 752834, 1218111, 1970945, 3189056, 5160001, 8349057, 13509058, 21858115, 35367173, 57225288, 92592461, 149817749

Offset: 0

Author

N. J. A. Sloane, Jun 14 1998

Keywords

• nonn
• easy

Links

• Ivan Panchenko, Table of n, a(n) for n = 0..1000
• Tanya Khovanova, Recursive Sequences
• Index entries for linear recurrences with constant coefficients, signature (1, 1).

Programs

Mathematica

a={};b=2;c=15;AppendTo[a,b];AppendTo[a,c];Do[b=b+c;AppendTo[a,b];c=b+c;AppendTo[a,c],{n,1,40,1}];a (* Vladimir Joseph Stephan Orlovsky, Jul 23 2008 *)
Transpose[NestList[{#[[2]],#[[1]]+#[[2]]}&,{2,15},40]][[1]] (* Harvey P. Dale, Dec 16 2010 *)
CoefficientList[Series[(2 + 13 x)/(1 - x - x^2), {x, 0, 40}], x] (* Wesley Ivan Hurt, Jun 15 2014 *)
LinearRecurrence[{1,1},{2,15},40] (* Harvey P. Dale, Sep 22 2024 *)

Formula

G.f.: (2+13*x)/(1-x-x^2). - Philippe Deléham, Nov 19 2008

a(n) = a(n-1) + a(n-2). - Wesley Ivan Hurt, Oct 01 2021

Extensions

More terms from Wesley Ivan Hurt, Jun 15 2014