OFFSET
0,2
LINKS
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (11,1).
FORMULA
G.f.: (1 - 3*x)/(1 - 11*x - x^2);
a(n) = 11*a(n-1) + a(n-2). [corrected by Philippe Deléham, Nov 16 2008]
a(n) = Sum_{k=0..5*n} binomial(k, 5*n-k).
2*a(n) = Fibonacci(5*n) + Lucas(5*n). - Bruno Berselli, Oct 13 2017
MAPLE
with(combinat): A099100:=n->fibonacci(5*n+1): seq(A099100(n), n=0..20); # Wesley Ivan Hurt, Nov 18 2014
MATHEMATICA
Fibonacci/@(5*Range[0, 30]+1) (* Vladimir Joseph Stephan Orlovsky, Mar 01 2010 *)
PROG
(Magma) [Fibonacci(5*n+1): n in [0..100]]; // Vincenzo Librandi, Apr 16 2011
(PARI) a(n)=fibonacci(5*n+1) \\ Charles R Greathouse IV, Sep 28 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paul Barry, Sep 29 2004
STATUS
approved