OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
R. Kemp, On the number of words in the language {w in Sigma* | w = w^R }^2, Discrete Math., 40 (1982), 225-234. See Lemma 6 (p. 228).
Index entries for linear recurrences with constant coefficients, signature (0,4,0,-4).
FORMULA
From Bruno Berselli, Mar 22 2011: (Start)
G.f.: 2*x*(1+x)*(1+2*x)/(1-2*x^2)^2.
a(n)/a(n-2) = 2*n/(n-2). (End)
a(2*n) = 3*n*2^n, a(2*n+1) = (2*n+1)*2^(n+1). - Andrew Howroyd, Mar 28 2016
MAPLE
R:=(b, n)-> expand(simplify( (n/4)*b^(n/2)*((1+sqrt(b))^2+(-1)^n*(1-sqrt(b))^2) ));
[seq(R(2, n), n=0..100)];
MATHEMATICA
CoefficientList[Series[2 x (1 + x) (1 + 2 x) / (1 - 2 x^2)^2, {x, 0, 40}], x] (* Vincenzo Librandi, Jun 19 2013 *)
PROG
(PARI) x='x+O('x^30); concat([0], Vec(2*x*(1+x)*(1+2*x)/(1-2*x^2)^2)) \\ G. C. Greubel, Nov 28 2017
(Magma) [Round((n/4)*2^(n/2)*((1+Sqrt(2))^2 + (-1)^n*(1-Sqrt(2))^2)): n in [0..30]]; // G. C. Greubel, Nov 28 2017
(Python)
def A187272(n): return (n<<(n+1>>1) if n&1 else 3*n<<(n-2>>1)) if n else 0 # Chai Wah Wu, Feb 18 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Mar 07 2011
STATUS
approved