2496144

Appears in sequences

• a(n) = binomial(n,11).at n=13A001288
• a(n) = binomial coefficient C(2n, n-1).at n=12A001791
• Valence of graph of maximal intersecting families of sets.at n=23A007007
• 12-dimensional centered tetrahedral numbers.at n=11A008506
• Binomial coefficient C(24,n).at n=11A010940
• Binomial coefficient C(24,n).at n=13A010940
• a(n) = binomial(n,13).at n=11A010966
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted.at n=27A024753
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=12A024754
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted.at n=13A024754
• Binomial coefficients: C(n,k), 8 <= k <= n-8, sorted, duplicates removed.at n=27A024760
• Binomial coefficients: C(n,k), 9 <= k <= n-9, sorted, duplicates removed.at n=15A024761
• Binomial coefficients: C(n,k), 10 <= k <= n-10, sorted, duplicates removed.at n=7A024762
• a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n and s(0) = 3. Also a(n) = Sum{T(n,k), k = 0,1,...,[ (n+3)/2 ]}, where T is defined in A026022.at n=22A026023
• a(n) = binomial(n, floor((n-1)/2)).at n=24A037952
• a(n) = binomial(n, floor(n/2)-1).at n=24A037955
• T(2n+2,n), array T as in A050186; a count of aperiodic binary words.at n=11A051195
• A diagonal of A059419.at n=16A059421
• a(n) = binomial(a,b) where a>=b and one of a and b is the product of the nonzero decimal digits of n and the other is the sum of the decimal digits of n.at n=38A067453
• Triangle read by rows: T(m,n) = binomial(m!,n), m>=0, 0 <= n <= m!.at n=25A105291