49915

Appears in sequences

• a(n) = K_3(n) = Sum_{k>=0} A090285(3,k)*2^k*binomial(n,k). a(n) = (4*n^3+30*n^2+56*n+15)/3.at n=31A090294
• a(n) = Sum_{k=0..n} 2^k*C([(n+k)/2],k)*C([(n+k+1)/2],k) where [x]=floor(x).at n=9A124431
• a(n) is the smallest m for which binomial(m, 6) has exactly n distinct prime factors.at n=17A321852
• Number of partitions of the (n+4)-multiset {0,...,0,1,2,3,4} with n 0's into distinct multisets.at n=17A346824