94586
domain: N
Appears in sequences
- Number of necklaces of partitions of n+1 labeled beads.at n=7A000629
- Aliquot sequence starting at 660.at n=10A014362
- Erroneous version of A002050.at n=6A047782
- 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=35A054255
- Triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} defined by a(0,0)=1, a(n,0)=A000670(n), a(n,n)=A000629(n), a(n,k) = a(n,k-1) + a(n-1,k-1); a(n+1,0) = Sum_{k=0..n} a(n,k).at n=35A073146
- a(n) = Sum_{k>=0} k^n/2^k.at n=7A076726
- Matrix product of Stirling2-triangle A008277(n,k) and unsigned Stirling1-triangle |A008275(n,k)|.at n=28A079641
- Triangle read by rows: T(n,k) = number of preferential arrangements of n things where the first object has rank k.at n=28A090665
- Triangle T(n,k), 0<=k<=n, read by rows, given by [1, 2, 2, 4, 3, 6, 4, 8, 5, 10, 6, 12, . . . ] DELTA [2, 1, 4, 2, 6, 3, 8, 4, 10, 5, 12, 6, . . . ] where DELTA is the operator defined in A084938.at n=35A108694
- 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=37A129062
- Triangle read by rows, A095989 convolved with A000670.at n=37A163204
- 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=28A171694
- Triangle of coefficients of a sequence of binomial type polynomials.at n=28A195204
- Triangle read by rows: T(n,k) (1 <= k <= n) = Steffensen's bracket function [n,n-k].at n=35A241168
- 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=43A292915
- Number of matrices of size n whose entries cover an initial interval of positive integers.at n=6A323868
- 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=37A369435
- Array read by falling antidiagonals: T(n,k) = numerator(Sum_{x>0} (x^n)/(k^x)); n >= 0 and k >= 2.at n=35A374895