75905

Appears in sequences

• Shifts one place left under 2nd-order binomial transform.at n=8A004211
• Maximal number of 15432 patterns in a permutation of 1,2,...,n.at n=30A100355
• Triangle, generated from A111579.at n=57A111673
• Exponential Riordan array [exp(sinh(x)*exp(x)), sinh(x)*exp(x)].at n=36A154602
• Square array read by antidiagonals upwards: T(n,k) = Sum_{j=1..k} n^(k-j)*Stirling_2(k,j) (n >= 0, k >= 1).at n=52A241578
• Square array read by antidiagonals downwards: T(n,k) = Sum_{j=1..k} n^(k-j)*Stirling_2(k,j) (n >= 0, k >= 1).at n=47A241579
• Number of set partitions C_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks; triangle C_t(n), t>=0, 0<=n<=t, read by rows.at n=44A261275
• Numbers k for which A003973(k) is equal to 2*sigma(k).at n=28A337384
• Triangle read by rows. T(n, k) = k^n * BellPolynomial(n, 1/k) for k > 0, if k = 0 then T(n, k) = k^n.at n=38A350260
• G.f. A(x) satisfies: A(x) = x + x^2 * exp( Sum_{k>=1} A(x^k)^2 / (k*x^k) ).at n=13A363387
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows, where T(n,k) = Sum_{j=k..n} 2^(n-j) * Stirling2(n,j) * Stirling2(j,k).at n=37A383206