OFFSET
0,2
REFERENCES
B. M. E. Moret and H. D. Shapiro, Algorithms from P to NP, Benjamin/Cummings, Vol. 1, 1991; p. 63.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,-6).
FORMULA
a(n) = 5*a(n - 1) - 6*a(n - 2).
G.f.: (1+2*x)/((1-2*x)*(1-3*x)). - Colin Barker, Jan 14 2012
a(n) = A217764(n,8). - Ross La Haye, Mar 27 2013
MAPLE
a := proc(n) option remember; if n = 0 then RETURN(1) end if; if n = 1 then RETURN(7) end if; 5*a(n - 1) - 6*a(n - 2); end proc;
MATHEMATICA
LinearRecurrence[{5, -6}, {1, 7}, 30] (* Vincenzo Librandi, Jan 15 2012 *)
Table[5*3^n-4*2^n, {n, 0, 30}] (* Harvey P. Dale, Jul 16 2024 *)
PROG
(Magma) I:=[1, 7]; [n le 2 select I[n] else 5*Self(n-1)-6*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Jan 15 2012
(PARI) a(n)=5*3^n-4<<n \\ Charles R Greathouse IV, Jan 15 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Feb 25 2005
EXTENSIONS
New definition from Ralf Stephan, May 17 2007
STATUS
approved