32670

Appears in sequences

• Stirling numbers of first kind, s(n+3, n), negated.at n=8A001303
• a(n) = binomial(n+5,5) * binomial(n+5,4)/(n+5).at n=7A006857
• Number of B-trees of order 3 with n leaves.at n=29A014535
• Theta series of A*_10 lattice.at n=37A023922
• Multiplicity of highest weight (or singular) vectors associated with character chi_29 of Monster module.at n=41A034417
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*11^j.at n=17A038229
• Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*3^j.at n=18A038317
• Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n+2)/3.at n=33A048081
• Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n+3)/3.at n=33A048092
• Number of antichains (or order ideals) in the poset 4*m*n or plane partitions with at most m rows and n columns and entries <= 4.at n=47A056940
• Number of antichains (or order ideals) in the poset 4*m*n or plane partitions with at most m rows and n columns and entries <= 4.at n=52A056940
• Number of perfect powers (A001597) not exceeding 10^n.at n=9A070428
• Duplicate of A070428.at n=9A077284
• Eighth column (and diagonal) of Narayana triangle A001263.at n=4A134289
• Number of 4 X 7 matrices with elements in 0..n with each row and each column in nondecreasing order. 4,7,n can be permuted, see formula.at n=2A140908
• Triangle T(n,m) read by rows: T(n,m) = Product_{i=0..6} binomial(n+i,m)/binomial(m+i,m).at n=23A142467
• Triangle T(n,m) read by rows: T(n,m) = Product_{i=0..6} binomial(n+i,m)/binomial(m+i,m).at n=25A142467
• 9th column of A145142.at n=3A145151
• Smallest k such that p^p -+ k is prime, where p=prime(n).at n=32A157719
• Triangle read by rows: the coefficient [x^k] of the polynomial Product_{i=1..n} (3^(i-1)-x) in row n, column k, 0 <= k <= n.at n=17A157783