888030

Appears in sequences

• a(n) = binomial coefficient C(n,7).at n=20A000580
• a(n) = binomial(3n+6, n).at n=7A003408
• Binomial coefficient C(27,n).at n=7A010943
• Binomial coefficient C(27,n).at n=20A010943
• a(n) = binomial(n,20).at n=7A010973
• a(n) = binomial(2*n+1, n-6).at n=7A030056
• Denominators of continued fraction convergents to sqrt(222).at n=11A041415
• T(n,7), array T as in A050186; a count of aperiodic binary words.at n=20A051192
• Binomial coefficients C(2*n+7,7).at n=10A053136
• Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=37A089434
• Sum of integers generated by n-1 substitutions, starting with 1, k -> k+1, k-1, .., 1.at n=17A093951
• Triangle of Generalized Runyon numbers R_{n,k}^(3) read by rows.at n=43A173020
• Number of faces of dimension n in a tight triangulation of the manifold OP^2.at n=6A202289
• a(n) = Sum_{k=0..10} binomial(20,k)*binomial(n,k).at n=7A247615
• a(n) = 3*binomial(n+1,6).at n=21A253943
• a(n) = binomial(4*n-1,n).at n=7A262977
• Number of subsets of [n] in which exactly half of the elements are Fibonacci numbers.at n=27A357927
• a(n) is the number of positive integers that have n prime factors and these are all <= n.at n=19A377537
• a(n) = [x^n] 1/(1 - x)^(n*(n-1)/2).at n=7A386879