394353

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=8A000262
• Denominators of continued fraction for alternating factorial.at n=15A056953
• Triangle T = A007318*A271703; T(n,m)= Sum_{i=0..n} L'(n,i)*binomial(i,m), m=0..n.at n=36A059110
• Triangle T(n,m)= Sum_{i=0..n} L'(n,i)*Product_{j=1..m} (i-j+1), read by rows.at n=36A059114
• Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1.at n=28A059374
• 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=34A086885
• Matrix product of unsigned Lah-triangle |A008297(n,k)| and Stirling2-triangle A008277(n,k).at n=28A088814
• Exponential Riordan array [e^(x/(1-x)),x].at n=36A129652
• A coefficient tree from the list partition transform relating A111884, A084358, A000262, A094587, A128229 and A131758.at n=35A131202
• Triangle read by rows: Sum_{j=0..k} binomial(n, j)*binomial(k, j)*j!.at n=43A176120
• Triangle, read by rows, T(n,k) = Sum_{j=1..k} binomial(n-1, j-1)*binomial(k, j - 1)*(j-1)!.at n=35A176122
• Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle.at n=36A206703
• 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=36A216294
• Square array read by upward antidiagonals, A(n,k) = Sum_{j=0..n} (n-j)!*C(n,n-j)* C(n-1,n-j)*k^j, for n>=0 and k>=0.at n=46A253286
• Triangle read by rows, T(n,k) = |n,k|*h(k), where |n,k| are the Stirling cycle numbers and h(k) = hypergeom([-k+1,-k],[],1), for n>=0 and 0<=k<=n.at n=44A256548
• 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=44A256549
• 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=37A256892
• 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=44A257740
• 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=44A261764
• Triangle read by rows: Bell transform of A000262.at n=46A265608