OFFSET
0,3
LINKS
Karl V. Keller, Jr., Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (31,-29).
FORMULA
a(n) = (1/13)*sum(k=0, n, binomial(n, k)*F(7*k)) where F(k) denotes the k-th Fibonacci number.
G.f.: x / (29*x^2-31*x+1). - Colin Barker, Jun 26 2013
MAPLE
f:=proc(n) option remember; if n <=1 then n else 31*f(n-1)-29*f(n-2); fi; end;
MATHEMATICA
LinearRecurrence[{31, -29}, {0, 1}, 30] (* Harvey P. Dale, Jul 11 2014 *)
PROG
(PARI) a(n)=(1/13)*sum(k=0, n, binomial(n, k)*fibonacci(7*k))
(Magma) I:=[0, 1]; [n le 2 select I[n] else 31*Self(n-1)-29*Self(n-2): n in [1..20]]; // Vincenzo Librandi, Jun 02 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Benoit Cloitre, Jun 21 2003
EXTENSIONS
Corrected by N. J. A. Sloane, Sep 16 2005
STATUS
approved