4912515

Appears in sequences

• A simple grammar: rooted ordered set partitions.at n=9A052882
• Triangle read by rows, T(n, k) = binomial(n, k) * Sum_{j=0..n-k} E(n-k, j)*2^j, where E(n, k) are the Eulerian numbers A173018(n, k), for 0 <= k <= n.at n=46A154921
• Triangle relating to ordered Bell numbers, A000670.at n=44A208744
• Triangle read by rows: T(n,k) is the number of labeled loop-threshold graphs on vertex set [n] with k components, for n >= 1 and 1 <= k <= n.at n=37A350531