63004

Appears in sequences

• a(n) = 2^(2*n+1) - C(2*n+3,n+1) + C(2*n+1,n).at n=8A006419
• a(n) = Sum_{k=0..7} binomial(n,k).at n=18A008860
• Convolution of (1, p(1), p(2), ...) and (F(2), F(3), F(4), ...).at n=18A023628
• Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= Sum_{j=0..n} T(n-j,k-1)*binomial(2j+1,j+1).at n=47A090285
• Riordan matrix (1/(1-4x),(1-sqrt(1-4x))/2).at n=58A187926
• Number of valleys at level 0 in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0) steps at positive heights).at n=18A191389
• Triangle read by rows: T(n,k) is the number of rooted planar maps with n edges, k faces and no isthmuses, n >= 0, k = 1..n+1.at n=53A342981
• a(n) = Sum_{k=0..n} binomial(3*n-3,k).at n=7A385823