1091670

Appears in sequences

• Number of necklaces of partitions of n+1 labeled beads.at n=8A000629
• Erroneous version of A002050.at n=7A047782
• Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows).at n=44A054255
• a(n) = Sum_{k>=0} k^n/2^k.at n=8A076726
• Matrix product of Stirling2-triangle A008277(n,k) and unsigned Stirling1-triangle |A008275(n,k)|.at n=36A079641
• Triangle read by rows: T(n,k) = number of preferential arrangements of n things where the first object has rank k.at n=36A090665
• T(n, k) = [x^k] Sum_{k=0..n} Stirling2(n, k)*RisingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n.at n=46A129062
• Triangular array, inverse of 2*P - I, where P is Pascal's triangle and I is the identity matrix.at n=36A162312
• Triangle read by rows, A095989 convolved with A000670.at n=46A163204
• Expansion of g.f.: 4^n*n!*(1-y)^(n+1)*f(x, y, m), where f(x, y, m) = 2^(m+1)*exp(2^m*t)/((1-y*exp(t))*(1 + (2^(m+1)-1)*exp(2^m*t))), and m = -2.at n=36A171694
• a(n) = Sum_{k>=1} k^(2*n)/(2^k).at n=4A227044
• Triangle read by rows: T(n,k) (1 <= k <= n) = Steffensen's bracket function [n,n-k].at n=44A241168
• Square array A(n, k) read by descending antidiagonals, where column k is the expansion of the e.g.f. exp(k*x)/(2 - exp(x)).at n=53A292915
• Square array A(n, k) = n! * [t^n] (exp(t)/(1+k-k*exp(t))) for n >= 0 and k >= 0, read by antidiagonals upwards.at n=46A369435
• Array read by falling antidiagonals: T(n,k) = numerator(Sum_{x>0} (x^n)/(k^x)); n >= 0 and k >= 2.at n=44A374895