OFFSET
0,3
COMMENTS
This sequence was initially confused with A003120, but they are different sequences. The g.f. used here as the definition was found by Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Gy. Tasi and F. Mizukami, Quantum algebraic-combinatoric study of the conformational properties of n-alkanes, J. Math. Chemistry, 25, 1999, 55-64 (see p. 63).
Index entries for linear recurrences with constant coefficients, signature (3,1,-7,3,-1,1,1).
FORMULA
From G. C. Greubel, May 21 2021: (Start)
a(n) = (2 + Q(n) + 2*(1+(-1)^n)*Pell((n+2)/2) + 2*(1-(-1)^n)*Pell((n+1)/2))/8.
a(2*n) = (2 + Q(2*n) + 4*Pell(n+1))/8.
MAPLE
MATHEMATICA
LinearRecurrence[{3, 1, -7, 3, -1, 1, 1}, {1, 1, 2, 3, 7, 13, 31}, 40] (* Vincenzo Librandi, Aug 28 2016 *)
Table[(2 +LucasL[n, 2] +2*(1+(-1)^n)*Fibonacci[(n+2)/2, 2] + 2*(1-(-1)^n)*Fibonacci[(n+1)/2, 2])/8, {n, 0, 40}] (* G. C. Greubel, May 21 2021 *)
PROG
(Magma) m:=40; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!( (1-2*x-2*x^2 +3*x^3+x^5)/((1-x)*(1-2*x-x^2)*(1-2*x^2-x^4)) )); // Vincenzo Librandi, Aug 28 2016
(Sage)
@CachedFunction
def Pell(n): return n if (n<2) else 2*Pell(n-1) + Pell(n-2)
def A193530(n): return (1 + Pell(n+1) - Pell(n) + (1 + (-1)^n)*Pell((n+2)/2) + (1-(-1)^n)*Pell((n+1)/2) )/4
[A193530(n) for n in (0..40)] # G. C. Greubel, May 21 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
F. Chapoton and N. J. A. Sloane, Jul 29 2011
STATUS
approved