600875

Appears in sequences

• a(n) = 10*binomial(2*n + 1, n - 4)/(n + 6).at n=8A003519
• a(n) = T(3n+1,n), where T = Catalan triangle (A008315).at n=8A026004
• Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k components (1<=k<=n).at n=46A094021
• Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k edges.at n=53A094040
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross downwards the x-axis k times. (A Grand Dyck path of semilength n is a path in the half-plane x>=0, starting at (0,0), ending at (2n,0) and consisting of steps u=(1,1) and d=(1,-1)).at n=44A118919
• a(1) = 1; a(2) = 0; a(3) = 0; a(4) = 0; a(5) = 0; a(6) = 0; a(7) = 0; a(8) = 0; a(9) = 0; a(10) = 0; a(n) = a(n - 1) + 9a(n - 2) - 8a(n - 3) - 28a(n - 4) + 21a(n - 5) + 35a(n - 6) - 20a(n - 7) - 15a(n - 8) + 5a(n - 9) + a(n - 10) for n >= 11.at n=26A122602
• 9th column of Catalan triangle A009766.at n=9A124087
• Number of free tree-like 4d-polycubes of size n.at n=9A304198
• Number of Young tableaux of shape [n, floor(n/2)].at n=17A368567