The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A289476 Number of Dyck paths of semilength 6*n and height n. 2
 1, 1, 2047, 9096393, 44100374341, 203421120941736, 877820839402932499, 3578930527547615106601, 13968353507597683646018640, 52773530288643811045085269442, 194648265795425910705859329140951, 705285559217587334571033534680055625 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..283 FORMULA a(n) ~ 2^(24*n + 7/2) * 3^(12*n + 1/2) / (5^(5*n+1/2) * 7^(7*n+7/2) * sqrt(Pi*n)). - Vaclav Kotesovec, Jul 14 2017 MAPLE b:= proc(x, y, k) option remember;       `if`(x=0, 1, `if`(y>0, b(x-1, y-1, k), 0)+       `if`(y <  min(x-1, k), b(x-1, y+1, k), 0))     end: a:= n-> `if`(n=0, 1, b(12*n, 0, n)-b(12*n, 0, n-1)): seq(a(n), n=0..20); MATHEMATICA b[x_, y_, k_]:=b[x, y, k]=If[x==0, 1, If[y>0, b[x - 1, y - 1, k], 0] + If[y

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 1 08:39 EDT 2020. Contains 337442 sequences. (Running on oeis4.)