346104

Appears in sequences

• a(n) = binomial coefficient C(n,7).at n=17A000580
• Binomial coefficient C(2n,n-5).at n=7A004311
• a(n) = binomial(3*n, n - 1).at n=7A004319
• Binomial coefficient C(24,n).at n=7A010940
• Binomial coefficient C(24,n).at n=17A010940
• a(n) = binomial(n,17).at n=7A010970
• Number of compositions of n into 8 ordered relatively prime parts.at n=17A023033
• Binomial coefficients: C(n,k), 7 <= k <= n-7, sorted, duplicates removed.at n=22A024759
• T(n,7), array T as in A050186; a count of aperiodic binary words.at n=17A051192
• Binomial coefficients C(2*n-6,7).at n=8A053129
• Number of walks of length n between two nodes at distance 3 in the cycle graph C_9.at n=19A095368
• Triangle read by rows: T(m,n) = binomial(m!,n), m>=0, 0 <= n <= m!.at n=21A105291
• Triangle read by rows: T(m,n) = binomial(m!,n), m>=0, 0 <= n <= m!.at n=31A105291
• Triangle read by rows: T(n,k) = binomial(t(n) - t(k-1),k), where t(j) = j*(j+1)/2; 1<=k<=n.at n=42A110770
• a(n) = binomial(floor((3n+4)/2),floor(n/2)).at n=15A127040
• a(n) = (1/10)*(2^(4*n-1)-5^n*L(2*n)+L(4*n)), where L() = Lucas numbers A000032.at n=5A133415
• a(n) = binomial(floor(n*sqrt(2)),n) for n>=0.at n=17A135964
• Triangle read by rows: T(n, k) = binomial(3*n+1-k, n-k) for n, k >= 0.at n=37A144484
• a(n) = Sum_{j=1..floor(n/2)} binomial(n+j-1,j-1).at n=15A175167
• Triangle read by rows which contains the (6n)-th row of the Pascal triangle in row n.at n=47A176849