116280

Appears in sequences

• a(n) = binomial coefficient C(n,7).at n=14A000580
• a(n) = binomial(3n,n).at n=7A005809
• From paths in the plane.at n=6A006859
• Binomial coefficient C(21,n).at n=7A010937
• Binomial coefficient C(21,n).at n=14A010937
• a(n) = binomial coefficient C(n,14).at n=7A010967
• Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted.at n=23A024751
• Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted.at n=24A024751
• Binomial coefficients: C(n,k), 6 <= k <= n-6, sorted, duplicates removed.at n=25A024758
• Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted, duplicates removed.at n=13A024759
• a(n) = binomial(2n+1,n-3).at n=7A030053
• Number of bracelets (turnover necklaces) of n beads of 2 colors, 7 of them black.at n=29A032280
• a(n) = binomial(n, floor((n-7)/2)).at n=21A037954
• a(n) = binomial(n, floor((n-6)/2)).at n=21A037957
• a(n) = binomial(n, floor(n/3)).at n=21A051033
• Products of 4 consecutive integers: a(n) = n*(n-1)*(n-2)*(n-3).at n=20A052762
• a(n) = n*(n-1)*(n-2)*(n-3) for n>=5.at n=20A052768
• Binomial coefficients C(2*n+7,7).at n=7A053136
• a(n) = 4*n*(4*n-1)*(4*n-2)*(4*n-3).at n=5A054777
• Table by antidiagonals of number of ways of choosing k items from n*k.at n=38A060539