OFFSET
0,2
COMMENTS
a(n) = A050168(n+1) - 1.
Number of Dyck (n+1)-paths that are symmetric after deleting all leading hills. - David Scambler, Aug 23 2012
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
MATHEMATICA
T[_, 0] = 1; T[n_, 1] := n; T[n_, n_] := T[n - 1, n - 2]; T[n_, k_] /; 1 < k < n := T[n, k] = T[n - 1, k] + T[n - 1, k - 2];
a[n_] := Sum[T[n, k], {k, 0, n}];
Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Feb 03 2018, from A208101 *)
PROG
(Haskell)
a208976 n = a208976_list !! n
a208976_list = map (subtract 1) $ tail a050168_list
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 04 2012
STATUS
approved