OFFSET
0,5
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2, -1, -1).
FORMULA
a(n) = Sum_{k=0..floor(n/3)} (-1)^k*binomial(n-k, 2*k). - Vladeta Jovovic, Feb 10 2003
a(0)=1, a(n+1) = a(n) - Sum_{k=0..n-2} a(k). - Alex Ratushnyak, May 03 2012
a(0)=1, a(1)=1, a(2)=1, a(n) = 2*a(n-1)-a(n-2)-a(n-3). - Harvey P. Dale, Nov 03 2013
MATHEMATICA
CoefficientList[Series[(1-x)/(1-2x+x^2+x^3), {x, 0, 50}], x] (* or *) LinearRecurrence[{2, -1, -1}, {1, 1, 1}, 50] (* Harvey P. Dale, Nov 03 2013 *)
PROG
(Python)
a = [1]*1000
for n in range(55):
print(a[n], end=', ')
sum=0
for k in range(n-1):
sum+=a[k]
a[n+1] = a[n]-sum
# from Alex Ratushnyak, May 03 2012
(PARI) Vec((1-x)/(1-2*x+x^2+x^3)+O(x^50)) \\ Charles R Greathouse IV, Sep 26 2012
(Magma) R<x>:=PowerSeriesRing(Integers(), 50); Coefficients(R!( (1-x)/( 1-2*x+x^2+x^3) )); // G. C. Greubel, Jun 27 2019
(Sage) ((1-x)/(1-2*x+x^2+x^3)).series(x, 50).coefficients(x, sparse=False) # G. C. Greubel, Jun 27 2019
(GAP) a:=[1, 1, 1];; for n in [4..50] do a[n]:=2*a[n-1]-a[n-2]-a[n-3]; od; a; # G. C. Greubel, Jun 27 2019
CROSSREFS
KEYWORD
sign,easy
AUTHOR
N. J. A. Sloane, Nov 17 2002
STATUS
approved