|
|
A024482
|
|
a(n) = (1/2)*(binomial(2n, n) - binomial(2n-2, n-1)).
|
|
9
|
|
|
2, 7, 25, 91, 336, 1254, 4719, 17875, 68068, 260338, 999362, 3848222, 14858000, 57500460, 222981435, 866262915, 3370764540, 13135064250, 51250632510, 200205672810, 782920544640, 3064665881940, 12007086477750, 47081501377326, 184753963255176, 725510446350004
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Apparently the number of sawtooth patterns in all Dyck paths of semilength n, ([0,1],2,7,25,...). A sawtooth pattern is of the form (UD)^k, k >= 1. More generally, the number of sawtooth patterns of length > t in all Dyck paths with semilength (n+t), t >= 0. - David Scambler, Apr 23 2013
|
|
LINKS
|
|
|
FORMULA
|
D-finite with recurrence n*a(n) - (5*n-4)*a(n-1) + 2*(2*n-5)*a(n-2) = 0.
n*(3*n-5)*a(n) - 2*(3*n-2)*(2*n-3)*a(n-1) = 0. (End)
G.f.: ((1-x)*sqrt(1-4*x) - (1+x)*(1-4*x))/(2*(1-4*x)).
E.g.f.: (1/2)*( -1 - x + exp(2*x)*( (1-x)*BesselI(0, 2*x) + x*BesselI(1, 2*x) ) ). (End)
|
|
EXAMPLE
|
The path udUududD has two sawtooth patterns, shown in lower case.
|
|
MAPLE
|
Z:=(1-z-sqrt(1-4*z))/sqrt(1-4*z)/2: Zser:=series(Z, z=0, 32): seq(coeff(Zser, z, n), n=2..25); # Zerinvary Lajos, Jan 16 2007
|
|
MATHEMATICA
|
Table[(Binomial[2n, n]-Binomial[2n-2, n-1])/2, {n, 2, 30}] (* Harvey P. Dale, Mar 04 2011 *)
|
|
PROG
|
(Magma) [(3*n-2)*Catalan(n-1)/2: n in [2..40]]; // G. C. Greubel, Apr 03 2024
(SageMath) [(3*n-2)*catalan_number(n-1)/2 for n in range(2, 41)] # G. C. Greubel, Apr 03 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|