7726160
domain: N
Appears in sequences
- a(n) = binomial(n,11).at n=15A001288
- Binomial coefficients C(2n, n-2).at n=11A002694
- Binomial coefficient C(26,n).at n=11A010942
- Binomial coefficient C(26,n).at n=15A010942
- a(n) = binomial(n,15).at n=11A010968
- Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=23A024754
- Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=24A024754
- Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=24A024761
- Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=13A024762
- a(n) = binomial(n, floor((n-3)/2)).at n=26A037951
- a(n) = binomial(n, floor((n-4)/2)).at n=26A037956
- T(2n+4,n), array T as in A050186; a count of aperiodic binary words.at n=11A051197
- a(n) = binomial(floor(n*(1+sqrt(2))),n) for n>=0.at n=11A135965
- Cardinality of the smallest nonempty class of length minimal languages with exactly n nonempty words each over a countably infinite alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=28A291057
- Cardinality of the smallest nonempty class of length minimal languages with exactly n nonempty words each over a countably infinite alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=32A291057
- Triangle read by rows. T(n, k) = binomial(3*n - 1, 3*k - 1).at n=39A361949