OFFSET
0,1
REFERENCES
Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and Sons, 1998, p. 75
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 0..400
Index entries for linear recurrences with constant coefficients, signature (8,-8,1).
FORMULA
a(n) = 8*a(n-1) - 8*a(n-2) + a(n-3).
G.f.: (2-10*x+3*x^2)/((1-x)*(1-7*x+x^2)). - Colin Barker, Jun 24 2012
MAPLE
with(combinat): for n from 0 to 30 do printf(`%d, `, fibonacci(4*n+1)+1) od: # James A. Sellers, Mar 03 2003
MATHEMATICA
Fibonacci[4*Range[0, 30]+1]+1 (* or *) LinearRecurrence[{8, -8, 1}, {2, 6, 35}, 30] (* Harvey P. Dale, Jul 20 2011 *)
PROG
(Magma) [Fibonacci(4*n+1) +1: n in [0..30]]; // Vincenzo Librandi, Apr 15 2011
(PARI) vector(30, n, n--; fibonacci(4*n+1)+1) \\ G. C. Greubel, Jul 15 2019
(Sage) [fibonacci(4*n+1)+1 for n in (0..30)] # G. C. Greubel, Jul 15 2019
(GAP) List([0..30], n-> Fibonacci(4*n+1)+1); # G. C. Greubel, Jul 15 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
R. K. Guy, Mar 01 2003
EXTENSIONS
More terms from James A. Sellers, Mar 03 2003
STATUS
approved