OFFSET
0,2
COMMENTS
Binomial transform of 1,1,1,1,2,2,4,4,8,8,... (g.f.: (1-x)(1+x)^2/(1-2x^2)).
Row sums of number triangle A108350. - Paul Barry, May 31 2005
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-4,0,1).
FORMULA
G.f.: (1-2x)/((1-2x)^2-x^4) = (1-2x)/((1-x)^2(1-2x-x^2));
a(n) = 4a(n-1) - 4a(n-2) + a(n-4);
a(n) = ((sqrt(2)+1)^(n+1) + (sqrt(2)-1)^(n+1)(-1)^n)/(4*sqrt(2)) + (n+1)/2;
a(n) = Sum_{k=0..n} (1-k)*A000129(n-k+1).
a(n) = Sum_{k=0..n} Sum_{j=0..n-k} binomial(k, j)*binomial(n-j, k)*((j+1) mod 2). - Paul Barry, May 31 2005
a(n) = (1/2)*(Pell(n+1) + n + 1), where Pell(n) = A000129(n). - Ralf Stephan, May 15 2007 [corrected by Jon E. Schoenfield, Feb 19 2019]
MAPLE
with(combinat): seq((n+1+fibonacci(n+1, 2))/2, n=0..30); # Zerinvary Lajos, Jun 02 2008
MATHEMATICA
CoefficientList[Series[(1-2x)/((1-2x)^2-x^4), {x, 0, 40}], x] (* Harvey P. Dale, Mar 22 2011 *)
LinearRecurrence[{4, -4, 0, 1}, {1, 2, 4, 8}, 40] (* Vincenzo Librandi, Jun 25 2012 *)
PROG
(Magma) I:=[1, 2, 4, 8]; [n le 4 select I[n] else 4*Self(n-1)-4*Self(n-2)+Self(n-4): n in [1..30]]; // Vincenzo Librandi, Jun 25 2012
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Nov 06 2004
STATUS
approved