576037442

Appears in sequences

• A problem of configurations: a(0) = 1; for n>0, a(n) = (2n-1)!! - Sum_{k=1..n-1} (2k-1)!! a(n-k). Also the number of shellings of an n-cube, divided by 2^n n!.at n=10A000698
• Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^((2*p-1)/2)) = (2*p-1)*(column p of T), or [T^((2*p-1)/2)](m,0) = (2*p-1)*T(p+m,p+1) for all m>=1 and p>=0.at n=45A105615
• Triangle, read by rows, defined by: T(n,k) = Sum_{j=0..n-k-1} T(j+k,k)*T(n-j,k+1) for n > k >= 0, with T(n,n) = n+1.at n=45A127058
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=45A286781