13037895

Appears in sequences

• a(n) = binomial(n,11).at n=16A001288
• Binomial coefficients C(2n+1, n-2).at n=11A003516
• Binomial coefficient C(27,n).at n=11A010943
• Binomial coefficient C(27,n).at n=16A010943
• a(n) = binomial(n,16).at n=11A010969
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=17A024762
• a(n) = binomial(n, floor((n-5)/2)).at n=27A037953
• a(n) = binomial(n, floor((n-4)/2)).at n=27A037956
• T(2n+5,n), array T as in A050186; a count of aperiodic binary words.at n=11A051198
• a(n) = binomial(n, 2^floor(log_2(n))).at n=26A291665
• a(n) = binomial(n,k(n)), where k(2) = 1, k(n) = k(n-1) + (a(n-1) mod 2).at n=25A375972
• a(n) = least number in row n of Pascal's triangle that exceeds every number in row n-1.at n=25A382851
• a(n) = 12 * (5*n+2)! / ((3*n+1)! * (2*n+2)!).at n=5A384668