491825

Appears in sequences

• Number of different lattice paths running from (0,0) to (n,0) using steps from S = {(k,k) or (k,-k): k positive integer} that never go below the x-axis.at n=8A059231
• Triangle read by rows: T(n,k) = Sum_{j=0..k-1} T(n,j) + Sum_{j=1..n-k} T(n-j,k), with T(0,0)=1 and T(n,k) = 0 for k > n.at n=44A059450
• Series reversion of x/(1+5x+4x^2).at n=8A127846
• Number of lattice paths from {8}^n to {0}^n using steps that decrement one component such that for each point (p_1,p_2,...,p_n) we have p_1<=p_2<=...<=p_n.at n=2A227605
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) = Sum_{j=0..n} k^j * binomial(n,j) * Catalan(j+1).at n=52A386408