4596553

Appears in sequences

• Number of "sets of lists": number of partitions of {1,...,n} into any number of lists, where a list means an ordered subset.at n=9A000262
• Denominators of continued fraction for alternating factorial.at n=17A056953
• Triangle T = A007318*A271703; T(n,m)= Sum_{i=0..n} L'(n,i)*binomial(i,m), m=0..n.at n=45A059110
• Numerators of the coefficients in exp(x/(1-x)) power series.at n=9A067764
• Lower triangular matrix, read by rows: T(i,j) = number of ways i seats can be occupied by any number k (0<=k<=j<=i) of persons.at n=43A086885
• Matrix product of unsigned Lah-triangle |A008297(n,k)| and Stirling2-triangle A008277(n,k).at n=36A088814
• Exponential Riordan array [e^(x/(1-x)),x].at n=45A129652
• A coefficient tree from the list partition transform relating A111884, A084358, A000262, A094587, A128229 and A131758.at n=44A131202
• Triangle read by rows: Sum_{j=0..k} binomial(n, j)*binomial(k, j)*j!.at n=53A176120
• Triangle, read by rows, T(n,k) = Sum_{j=1..k} binomial(n-1, j-1)*binomial(k, j - 1)*(j-1)!.at n=44A176122
• Triangular array read by rows: T(n,k) is the number of partial permutations of {1,2,...,n} that have exactly k cycles, 0<=k<=n.at n=45A216294
• Triangle read by rows, T(n,k) = {n,k}*h(k), where {n,k} are the Stirling set numbers and h(k) = hypergeom([-k+1,-k],[],1), for n>=0 and 0<=k<=n.at n=54A256549
• Triangular array read by rows, the matrix product of the unsigned Lah numbers and the Stirling set numbers, T(n,k) for n>=0 and 0<=k<=n.at n=46A256892
• Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=54A257740
• Triangle read by rows: T(n,k) is the number of nilpotent subpermutations on an n-set, each of nilpotency index less than or equal to k.at n=54A261764
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x/(1 - x)^k).at n=64A293012
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. Product_{i>k} exp(x^i).at n=54A293053
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x/(1-x))/(1-x)^k.at n=54A293985
• Expansion of e.g.f. exp(Sum_{k=1..9} x^k).at n=9A306624
• Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the set; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=54A319501