A098127 Fibonacci sequence with a(1) = 7 and a(2) = 26.

7, 26, 33, 59, 92, 151, 243, 394, 637, 1031, 1668, 2699, 4367, 7066, 11433, 18499, 29932, 48431, 78363, 126794, 205157, 331951, 537108, 869059, 1406167, 2275226, 3681393, 5956619, 9638012, 15594631, 25232643, 40827274, 66059917, 106887191, 172947108

Offset: 1

Author

Parthasarathy Nambi, Sep 26 2004

Keywords

• nonn

Examples

			a(3) = a(2) + a(1) = 26 + 7 = 33.
		

Links

• Tanya Khovanova, Recursive Sequences
• Index entries for linear recurrences with constant coefficients, signature (1, 1).

Crossrefs

Cf. A022136, A097657.

Programs

Maple

a[1]:=7:a[2]:=26: for n from 3 to 37 do a[n]:=a[n-1]+a[n-2] od: seq(a[n],n=1..37); # Emeric Deutsch, Apr 16 2005

Mathematica

LinearRecurrence[{1, 1}, {7, 26}, 80] (* Vladimir Joseph Stephan Orlovsky, Feb 17 2012 *)

Formula

a(n) = a(n-1) + a(n-2).

G.f.: (7x + 19x^2)/(1 - x - x^2). - Emeric Deutsch, Apr 16 2005

Extensions

More terms from Emeric Deutsch, Apr 16 2005