30296

Appears in sequences

• 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=39A154921
• Triangle relating to ordered Bell numbers, A000670.at n=33A208744
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 613", based on the 5-celled von Neumann neighborhood.at n=29A273243
• 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=31A350531
• a(0) = 1; a(n) = Sum_{k=0..n-1} binomial(n+3,k+3) * a(k).at n=5A352863
• Numbers k which have a factorization k = f1*f2*...*fr where the digits of {k, f1, f2, ..., fr} together give 0,1,...,9 exactly once.at n=31A370970
• Numbers k which have a factorization k = f_1*f_2*...*f_r where f_i >= 1 and the digits of {k, f_1, f_2, ..., f_r} together give 0,1,...,9 exactly once.at n=47A372259