41990

Appears in sequences

• a(n) = 3*(2*n)!/((n+2)!*(n-1)!).at n=10A000245
• Number of distinct perforation patterns for deriving (v,b) = (n+2,n) punctured convolutional codes from (3,1).at n=5A007227
• Expansion of 1/(1-4*x)^(13/2).at n=4A020924
• Expansion of (1-4*x)^(19/2).at n=4A020931
• a(n) = T(n, floor(n/2)), where T = Catalan triangle (A008315).at n=19A026008
• Catalan's triangle with right border removed (n > 0, 0 <= k < n).at n=64A030237
• Triangle T(n,k), k>=0 and n>=1, read by rows defined by: T(n,k) = (2k+3)*binomial(2n,n-k-1)/(n+k+2).at n=45A050155
• Numbers k such that k!!!!!! - 1 is prime.at n=22A051592
• Triangle read by rows giving partial row sums of triangle A033184(n,m), n >= m >= 1 (Catalan triangle).at n=56A054445
• a(n) = 3*binomial(2n, n-1)/(n+2), n > 0, with a(0)=1.at n=10A071724
• Normalized triangle of odd numbered entries of even numbered rows of Pascal's triangle A007318.at n=49A091043
• Normalized triangle of odd numbered entries of even numbered rows of Pascal's triangle A007318.at n=50A091043
• Largest gcd of two distinct numbers on row n of Pascal's triangle.at n=18A092394
• Slanted Catalan convolution table, read by rows of 2*n+1 terms in row n, where T(n,k) = C(n+2*k-[k/2],k)*(n-[k/2])/(n+2*k-[k/2]).at n=58A100247
• Triangle read by rows: T(n,k) is the number of Dyck n-paths whose first descent has length k.at n=55A100537
• Triangle read by rows: T(n,k) is the number of Dyck n-paths whose first descent has length k.at n=67A100537
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and starting with exactly k UD's, where U=(1,1), D=(1,-1) (0 <= k <= n).at n=66A112413
• Triangle T(n,k) = lcm(1,...,2*n+2)/((k+1)*binomial(2*k+2,k+1)).at n=50A120101
• Isomers of polyenes attached to benzene (see Cyvin et al. for precise definition).at n=19A121094
• 10th column of Catalan triangle A009766.at n=2A124088