OFFSET
1,1
COMMENTS
REFERENCES
Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.
LINKS
Colin Barker, Table of n, a(n) for n = 1..1000
Creighton Kenneth Dement, Comments on A143608 and A143609
Clark Kimberling, Best lower and upper approximates to irrational numbers, Elemente der Mathematik, 52 (1997) 122-126.
Index entries for linear recurrences with constant coefficients, signature (0,6,0,-1).
FORMULA
a(n) = 6 * a(n-2) - a(n-4). a(2*n) = A001541(n) if n>0. a(2*n + 1) = 2 * A001653(n + 1).- Michael Somos, Sep 03 2013
G.f.: x * (2 + 3*x - 2*x^2 - x^3) / (1 - 6*x^2 + x^4). - Michael Somos, Sep 03 2013
a(n) = (2+sqrt(2)+(-1)^n*(-2+sqrt(2)))*((-1+sqrt(2))^n+(1+sqrt(2))^n)/(4*sqrt(2)). - Colin Barker, Mar 27 2016
EXAMPLE
2*x + 3*x^2 + 10*x^3 + 17*x^4 + 58*x^5 + 99*x^6 + 338*x^7 + 577*x^8 + ...
MATHEMATICA
Rest@ CoefficientList[Series[x (2 + 3 x - 2 x^2 - x^3)/(1 - 6 x^2 + x^4), {x, 0, 30}], x] (* Michael De Vlieger, Mar 27 2016 *)
PROG
(PARI) {a(n) = if( n<1, 0, polcoeff( x * (2 + 3*x - 2*x^2 - x^3) / (1 - 6*x^2 + x^4) + x * O(x^n), n))} /* Michael Somos, Sep 03 2013 */
(PARI) x='x+O('x^99); Vec(x*(2+3*x-2*x^2-x^3)/(1-6*x^2+x^4)) \\ Altug Alkan, Mar 27 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Aug 27 2008
STATUS
approved