|
|
A294527
|
|
Number of Dyck paths of length 2n with exactly 2 hills.
|
|
2
|
|
|
0, 0, 1, 0, 3, 6, 21, 66, 220, 744, 2562, 8942, 31569, 112530, 404445, 1464042, 5332872, 19532688, 71893470, 265778040, 986416614, 3674092044, 13729259586, 51455182260, 193369903608, 728504292576, 2750904025276, 10409856537786, 39470613237645, 149935171349546
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
LINKS
|
|
|
FORMULA
|
Conjecture: 2*(3*n-5) *(n-2) *(3*n+11) *(n+1) *a(n) -(3*n+11) *(n-3) *(21*n^2-35*n+10) *a(n-1) -2*(3*n+11) *(n-1) *(2*n-1) *(3*n-2) *a(n-2)= 0. - R. J. Mathar, Jun 24 2018
|
|
MATHEMATICA
|
a[n_] := Which[n>2, Sum[(i Binomial[i+2, i] Binomial[2n-2i-4, n-2])/(n-i-2), {i, 0, (n-2)/2}], n == 2, 1, True, 0];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|