605556
domain: N
Appears in sequences
- A convolution triangle of numbers obtained from A036068.at n=49A030524
- Number of paths in the lattice [0..n] X [0..n] X [0..n] which do not pass through the point (floor(n/2), floor(n/2), floor(n/2)). Number of paths through a lattice containing a "hole".at n=3A071803
- T(n, k) = Stirling1(n+1, k) - Stirling1(n, k-1), for 1 <= k <= n. Triangle read by rows.at n=39A094485
- Triangle T(n, k) = coefficients of (n+1)!*(binomial(x+n+1, n+1) - binomial(x, n+1)), read by rows.at n=39A178126
- G.f. satisfies: A(x) = Product_{n>=0} (1 + x*(x+x^2)^n)^2/(1 - x*(x+x^2)^n)^2.at n=14A192626