OFFSET
0,1
COMMENTS
After the first term, there are no primes in this sequence. In fact:
a(12*k) is divisible by 5,
a(12*k+1) is divisible by 2,
a(12*k+2) is divisible by 3,
a(12*k+3) is divisible by 2,
a(12*k+4) is divisible by 11,
a(12*k+5) is divisible by 2,
a(12*k+6) is divisible by 3,
a(12*k+7) is divisible by 2,
a(12*k+8) is divisible by 7,
a(12*k+9) is divisible by 2,
a(12*k+10) is divisible by 3,
a(12*k+11) is divisible by 2.
Therefore, every term is divisible by 2, 3, 5, 7, or 11.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2,1).
FORMULA
From Colin Barker, Oct 11 2016: (Start)
a(n) = (((1-sqrt(2))^n*(-3+5*sqrt(2))+(1+sqrt(2))^n*(3+5*sqrt(2))))/(2*sqrt(2)).
G.f.: (5-2*x) / (1-2*x-x^2).
(End)
MATHEMATICA
LinearRecurrence[{2, 1}, {5, 8}, 40] (* Alonso del Arte, Oct 11 2016 *)
PROG
(PARI) lista(n) = n++; my(v=vector(max(2, n))); v[1]=5; v[2]=8; for(i=3, n, v[i]=2*v[i-1] + v[i-2]); v \\ David A. Corneth, Oct 11 2016
(PARI) Vec((5-2*x)/(1-2*x-x^2) + O(x^40)) \\ Colin Barker, Oct 11 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Bobby Jacobs, Oct 11 2016
EXTENSIONS
More terms from David A. Corneth, Oct 11 2016
STATUS
approved