OFFSET
0,3
COMMENTS
Let the generator matrix for the binary Golay G_24 code be [I|B]. Then a(n)=(A^n)_1,2 for instance. Third binomial transform of (0,1,0,20,0,400,0,8000,...). - Paul Barry, Feb 13 2004
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,11).
FORMULA
a(n) = 6*a(n-1) + 11*a(n-2).
a(n) = (1/4)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*4^k. - Benoit Cloitre, Oct 25 2003
a(n) = sqrt(5)(3 + 2*sqrt(5))^n/20 - sqrt(5)(3 - 2*sqrt(5))^n/20. - Paul Barry, Feb 13 2004
E.g.f.: (exp(x*(3 + 2*sqrt(5))) - exp(x*(3 - 2*sqrt(5))))/(4*sqrt(5)). - Iain Fox, Dec 31 2017
MATHEMATICA
a[n_]:=(MatrixPower[{{1, 4}, {1, -7}}, n].{{1}, {1}})[[2, 1]]; Table[Abs[a[n]], {n, -1, 40}] (* Vladimir Joseph Stephan Orlovsky, Feb 19 2010 *)
LinearRecurrence[{6, 11}, {0, 1}, 30] (* Vincenzo Librandi, Nov 13 2012 *)
PROG
(Sage) [lucas_number1(n, 6, -11) for n in range(0, 21)] # Zerinvary Lajos, Apr 24 2009
(Magma) [n le 2 select n-1 else 6*Self(n-1) + 11*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 13 2012
(PARI) x='x+O('x^30); concat([0], Vec(x/(1 - 6*x - 11*x^2))) \\ G. C. Greubel, Dec 30 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved