A081073 Fibonacci(4n+2)+3, or Fibonacci(2n-1)*Lucas(2n+3).

4, 11, 58, 380, 2587, 17714, 121396, 832043, 5702890, 39088172, 267914299, 1836311906, 12586269028, 86267571275, 591286729882, 4052739537884, 27777890035291, 190392490709138, 1304969544928660, 8944394323791467

Offset

0,1

References

Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and Sons, 1998, p. 75.

Links

Paolo Xausa, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (8,-8,1).

Formula

a(n) = 8a(n-1) - 8a(n-2) + a(n-3).

G.f.: -(2*x^2-21*x+4)/((x-1)*(x^2-7*x+1)). - Colin Barker, Jun 22 2012

Maple

with(combinat): for n from 0 to 40 do printf(`%d, `, fibonacci(4*n+2)+3) od: # James A. Sellers, Mar 05 2003

Mathematica

Fibonacci[4*Range[0, 30]+2]+3 (* Paolo Xausa, Mar 01 2024 *)

Prog

(Magma) [Fibonacci(4*n+2)+3: n in [0..50]]; // Vincenzo Librandi, Apr 20 2011
(PARI) Vec(-(2*x^2-21*x+4)/((x-1)*(x^2-7*x+1)) + O(x^30)) \\ Michel Marcus, Dec 23 2014

Crossrefs

Cf. A000045 (Fibonacci numbers).

Sequence in context: A282742 A032181 A203577 * A245545 A002831 A246598

Adjacent sequences: A081070 A081071 A081072 * A081074 A081075 A081076

Keyword

nonn,easy

Author

R. K. Guy, Mar 04 2003

Extensions

More terms from James A. Sellers, Mar 05 2003

Status

approved