OFFSET
0,4
COMMENTS
The a(n+2) represent the Kn12 and Kn22 sums of the square array of Delannoy numbers A008288. See A180662 for the definition of these knight and other chess sums. - Johannes W. Meijer, Sep 21 2010
LINKS
Index entries for linear recurrences with constant coefficients, signature (2,0,0,-1).
FORMULA
a(n) = A000073(n+2)-1. - R. J. Mathar, Sep 22 2010
From Johannes W. Meijer, Sep 22 2010: (Start)
a(n) = a(n-1)+A001590(n+1).
a(n+2) = Sum_{k=0..floor(n/2)} A008288(n-k+1,k+1).
G.f. = x^2*(1+x)/((1-x)*(1-x-x^2-x^3)). (End)
a(n) = 2*a(n-1)-a(n-4), a(0)=0, a(1)=0, a(2)=1, a(3)=3. - Bruno Berselli, Sep 23 2010
MATHEMATICA
Join[{a=0, b=0, c=1}, Table[d=a+b+c+2; a=b; b=c; c=d, {n, 50}]] (* Vladimir Joseph Stephan Orlovsky, Apr 19 2011 *)
RecurrenceTable[{a[0]==a[1]==0, a[2]==1, a[n]==a[n-1]+a[n-2]+a[n-3]+2}, a[n], {n, 40}] (* or *) LinearRecurrence[{2, 0, 0, -1}, {0, 0, 1, 3}, 40] (* Harvey P. Dale, Sep 19 2011 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Roger L. Bagula, Dec 03 2003
EXTENSIONS
Corrected and information added by Johannes W. Meijer, Sep 22 2010, Oct 22, 2010
Definition based on arbitrarily set floating-point precision removed - R. J. Mathar, Sep 30 2010
STATUS
approved