649264

Appears in sequences

• a(n) = 4*binomial(4*n+11, n)/(n+4).at n=6A006635
• a(n) = binomial(2*n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)).at n=29A065346
• Triangle T(n,m) read by rows, obtained from [A(x)]^m = Sum_{n>=m} T(n,m)*x^n, where A(x) (the g.f. for A069271) satisfies 2*x^2*A(x)^3 = 1 - 2*x*A(x) - sqrt(1-4*x*A(x)).at n=71A188108
• Number of ways 2*n-1 people can vote on three candidates so that the Condorcet paradox arises.at n=31A277935