OFFSET
0,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (4, -4, 1).
FORMULA
a(n) = 5 (mod 9) = A010716(n) (mod 9).
a(n) = 3*a(n-1) - a(n-2) + 4.
a(n) = 4*a(n-1) - 4*a(n-2) + a(n-3).
a(n) = 3*a(n-1) - 3*a(n-3) + a(n-4).
G.f.: 4*(8 - 15*x + 8x^2)/((1-x)*(1 -3*x +x^2)). - R. J. Mathar, Jan 23 2009
MATHEMATICA
36*Fibonacci[2*Range[0, 30]+1]-4 (* or *) LinearRecurrence[{4, -4, 1}, {32, 68, 176}, 30] (* Harvey P. Dale, Jan 26 2013 *)
PROG
(Magma) [36*Fibonacci(2*n+1)-4: n in [0..30]]; // Vincenzo Librandi, Aug 07 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paul Curtz, Jan 04 2009
EXTENSIONS
Edited and extended by R. J. Mathar and N. J. A. Sloane, Jan 23 2009
STATUS
approved