927983760

Appears in sequences

• Number of permutations of [n+1] with exactly 1 increasing subsequence of length 3.at n=15A003517
• Binomial coefficient C(2n,n-4).at n=13A004310
• Binomial coefficient C(34,n).at n=13A010950
• Binomial coefficient C(34,n).at n=21A010950
• a(n) = binomial(n,13).at n=21A010966
• a(n) = binomial(n,21).at n=13A010974
• a(n) = binomial(n, floor((n-8)/2)).at n=34A037958
• a(n) = binomial(Fibonacci(n), Fibonacci(n-1)).at n=8A066526
• Largest gcd of two distinct numbers on row n of Pascal's triangle.at n=32A092394
• Row maximum of Catalan triangle with zeros (A053121), i.e., maximum value of (m+1)*binomial(n+1,(n-m)/2)/(n+1) for given n with m same parity as n.at n=35A101461
• a(n) = binomial(floor(n*(sqrt(5)+3)/2), n) for n>=0.at n=13A135963
• a(n) = binomial(3*n-2,n+1).at n=10A261186
• Expansion of (1 - sqrt(1 - 4*x))^5/16.at n=15A268329
• Binomial coefficients C(m,k) such that C(m,k), C(m,k+1), C(m,k+2) with 0 <= k <= m-2 form an increasing arithmetic progression.at n=3A349736
• Arises from enumeration of a certain class of partial zig-zag knight's paths on the square grid.at n=34A368379