42930

Appears in sequences

• A variant of the recurrence for A001190.at n=22A038751
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 1, -1), (1, 0, -1), (1, 0, 0)}.at n=10A148396
• Number T(n,k) of ordered set partitions of [n] into k blocks such that equal-sized blocks are ordered with increasing least elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=58A285824
• Number of ordered set partitions of [n] into three blocks such that equal-sized blocks are ordered with increasing least elements.at n=7A285918
• First differences of A293230: how many more alive nodes there are in generation n+1 than in generation n in the binary tree of persistently squarefree numbers.at n=38A293440
• Triangle read by rows, expansion of exp(x*z)*z*((exp(z) + 1)/((exp(z) + 2*exp(-z/2)*cos(z*sqrt(3)/2))/3) -1), for n >= 1 and 0 <= k <= n-1.at n=46A294034
• a(n) = a(n-1) + a(n-2) + a([(n-1)/2]), where a(0) = 1, a(1) = 2, a(2) = 3.at n=20A298353
• T(n, k) = A343277(n)*[x^k] p(n, x) where p(n, x) = (1/(n+1))*Sum_{k=0..n} (-1)^k*E1(n, k)*x^(n - k) / binomial(n, k), and E1(n, k) are the Eulerian numbers A123125. Triangle read by rows, for 0 <= k <= n.at n=42A342321
• Triangle read by rows. The Hadamard product of A173018 and A349203.at n=38A363154