245157

Appears in sequences

• a(n) = binomial coefficient C(n,7).at n=16A000580
• a(n) = 8*binomial(2*n+1,n-3)/(n+5).at n=8A003518
• Binomial coefficient C(23,n).at n=7A010939
• Binomial coefficient C(23,n).at n=16A010939
• a(n) = binomial(n,16).at n=7A010969
• Triangular array formed from odd elements to right of middle of rows of Pascal's triangle.at n=59A014475
• Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted, duplicates removed.at n=19A024759
• a(n) = binomial(3n-1, n-1).at n=8A025174
• a(n) = binomial(2n+1,n-4).at n=7A030054
• Take n equally spaced points on circle, connect them by a path with n-1 line segments; sequence gives number of distinct path lengths.at n=16A030077
• a(n) = binomial(n, floor((n-8)/2)).at n=23A037958
• a(n) = binomial(n, floor(n/3)).at n=23A051033
• T(n,7), array T as in A050186; a count of aperiodic binary words.at n=16A051192
• Binomial coefficients C(2*n+7,7).at n=8A053136
• Triangle, read by antidiagonals, where T(n,k) = C(n+n*k+k, n*k+k).at n=47A060543
• a(n) = binomial(prime(n), composite(n)).at n=8A073765
• Largest gcd of two distinct numbers on row n of Pascal's triangle.at n=21A092394
• Number of walks of length n between two adjacent nodes in the cycle graph C_9.at n=21A095364
• a(n) = binomial(floor((3n+2)/2), floor(n/2)).at n=15A099578
• Triangle read by rows, where the g.f. satisfies A(x, y) = 1 + x*A(x, y)^2 + x*y*A(x, y)^3.at n=43A104978