48621

Appears in sequences

• Euler characteristics of polytopes.at n=18A006481
• Expansion of 1/((1-5*x)*(1-7*x)*(1-10*x)).at n=4A019958
• a(n) = binomial(n, floor(n/2)) + 1.at n=18A051920
• Number of directed aggregates of height <= 2 with n cells.at n=12A082397
• a(n) = binomial(n, 9) + 1.at n=18A115205
• a(n) = ceiling(n^4/4).at n=21A131478
• Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=45A157531
• Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=54A157531
• Triangle T(n,k)= binomial(n + k,n) + binomial(2*n-k,n) read by rows.at n=45A171824
• Triangle T(n,k)= binomial(n + k,n) + binomial(2*n-k,n) read by rows.at n=54A171824
• Number of (v,w,x,y,z) with all terms in {0,1,...,n} and v=average(w,x,y,z).at n=20A212257
• Number of compositions of n with exactly nine occurrences of the largest part.at n=18A243744
• Number of compositions of n in which the minimal multiplicity of parts equals 9.at n=18A244172
• Number of compositions of 3n in which the minimal multiplicity of parts equals n.at n=9A244174
• Number of preferential arrangements of n labeled elements when at least k=8 elements per rank are required.at n=17A245793
• Number of preferential arrangements of n labeled elements when at least k=9 elements per rank are required.at n=18A245794
• a(n) = n*(n + 1)*(5*n^2 + 5*n - 4)/12.at n=18A264853
• a(n) = binomial(2*n-2, n-1) + (-1)^n.at n=9A286033
• Number of permutations of [n] avoiding {3412, 4132, 1324}.at n=11A294694
• a(n) = Sum_{k=0..n} binomial(k, 9*(n-k)).at n=19A306753