OFFSET
0,5
COMMENTS
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (-1,1,1).
FORMULA
G.f.: x*(1 + 2*x)/((1 - x)*(1 + x)^2).
a(n) = 3/4 + (2*n - 3)*(-1)^n/4.
a(0)=0, a(1)=1, a(2)=1, a(n)=a(n-1)+a(n-2)+a(n-3). - Harvey P. Dale, Mar 26 2012
G.f.: x*G(0)/(1+x) where G(k) = 1 + 2*x/(1 - x/(x + 2/G(k+1) )); (recursively defined continued fraction). - Sergei N. Gladkovskii, Dec 21 2012
E.g.f.: ((3 + x)*sinh(x) - x*cosh(x))/2. - Stefano Spezia, Mar 07 2023
MATHEMATICA
With[{nn=35}, Riffle[Range[0, nn], Range[1, -(nn-1), -1]]] (* or *) LinearRecurrence[ {-1, 1, 1}, {0, 1, 1}, 70] (* Harvey P. Dale, Mar 26 2012 *)
PROG
(Haskell)
import Data.List (transpose)
a097140 n = a097140_list !! n
a097140_list = concat $ transpose [a001477_list, map (1 -) a001477_list]
-- Reinhard Zumkeller, Nov 27 2012
(PARI) a(n)=3/4+(2*n-3)*(-1)^n/4 \\ Charles R Greathouse IV, Sep 02 2015
CROSSREFS
KEYWORD
easy,sign
AUTHOR
Paul Barry, Jul 29 2004
STATUS
approved