|
|
A258395
|
|
Number of 2n-length strings of balanced parentheses of exactly 7 different types that are introduced in ascending order.
|
|
2
|
|
|
429, 40040, 2246244, 98760480, 3761539782, 130505896752, 4245988489600, 131928199603200, 3962683868528385, 116039722090972680, 3332921846278964940, 94315723869947580000, 2638390752595156276410, 73147630662437905413840, 2013841857892713303414960
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
7,1
|
|
LINKS
|
|
|
FORMULA
|
Recurrence: (n-5)*(n-4)*(n-3)*(n-2)*(n-1)*n*(n+1)*a(n) = 56*(n-5)*(n-4)*(n-3)*(n-2)*(n-1)*n*(2*n - 1)*a(n-1) - 1288*(n-5)*(n-4)*(n-3)*(n-2)*(n-1)*(2*n - 3)*(2*n - 1)*a(n-2) + 15680*(n-5)*(n-4)*(n-3)*(n-2)*(2*n - 5)*(2*n - 3)*(2*n - 1)*a(n-3) - 108304*(n-5)*(n-4)*(n-3)*(2*n - 7)*(2*n - 5)*(2*n - 3)*(2*n - 1)*a(n-4) + 420224*(n-5)*(n-4)*(2*n - 9)*(2*n - 7)*(2*n - 5)*(2*n - 3)*(2*n - 1)*a(n-5) - 836352*(n-5)*(2*n - 11)*(2*n - 9)*(2*n - 7)*(2*n - 5)*(2*n - 3)*(2*n - 1)*a(n-6) + 645120*(2*n - 13)*(2*n - 11)*(2*n - 9)*(2*n - 7)*(2*n - 5)*(2*n - 3)*(2*n - 1)*a(n-7). - Vaclav Kotesovec, Jun 01 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|