cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A181716 a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.

Original entry on oeis.org

0, 1, 2, 2, 5, 6, 12, 17, 30, 46, 77, 122, 200, 321, 522, 842, 1365, 2206, 3572, 5777, 9350, 15126, 24477, 39602, 64080, 103681, 167762, 271442, 439205, 710646, 1149852, 1860497, 3010350, 4870846, 7881197, 12752042, 20633240, 33385281, 54018522, 87403802
Offset: 0

Views

Author

Robert G. Wilson v, Nov 07 2010

Keywords

Comments

Aside from the first term, duplicate of A098600.

Crossrefs

First differences of A014217.

Programs

  • Magma
    I:=[0, 1, 2]; [n le 3 select I[n] else 2*Self(n-2)+Self(n-3): n in [1..40]]; // Vincenzo Librandi, Jan 09 2012
    
  • Magma
    [Lucas(n-1)+(-1)^n: n in [0..40]]; // G. C. Greubel, Mar 25 2024
    
  • Mathematica
    a[0]= 0; a[1]= 1; a[n_]:= a[n]= a[n-1] +a[n-2] +(-1)^n; Array[a,38,0]
    LinearRecurrence[{0,2,1},{0,1,2},40] (* Vincenzo Librandi, Jan 09 2012 *)
  • SageMath
    [lucas_number2(n-1,1,-1)+(-1)^n for n in range(41)] # G. C. Greubel, Mar 25 2024

Formula

a(n) = a(n-1) + a(n-2) + (-1)^n.
a(n) = 2*a(n-2) + a(n-3).
a(n) - A000045(n) = A008346(n-2).
G.f.: x*(1+2*x)/(1-2*x^2-x^3). - Colin Barker, Jan 09 2012
a(n) = A000032(n-1) + (-1)^n. - G. C. Greubel, Mar 25 2024
E.g.f.: exp(x/2)*(sqrt(5)*sinh(sqrt(5)*x/2) - cosh(sqrt(5)*x/2)) + exp(-x). - Stefano Spezia, Jun 18 2024