86515

Appears in sequences

• a(n) = Sum_{k=0..n} binomial(n,k)*binomial(2*k,k).at n=8A026375
• a(n) = T(n,[ n/2 ]), where T is the array in A026374.at n=15A026380
• Self-convolution of array T given by A026374.at n=8A026946
• Riordan array (1/sqrt(1-6x+5x^2),(1-3x-sqrt(1-6x+5x^2))/(2x)).at n=36A110165
• Triangle read by rows: T(n,k) (0<=k<=floor(n/2)) is the number of Delannoy paths of length n, having k ED's.at n=20A110221
• Riordan array (1/sqrt(1-6x+5x^2),x/(1-6x+5x^2)).at n=36A111965
• Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial transform. Same as interpolating bilateral Schroeder paths (A026375) with the central binomial coefficients (A000984).at n=36A163841
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(k*x)*BesselI(0,2*x).at n=74A292627
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} k^j * binomial(n,j) * binomial(2*j,j).at n=53A340970
• Number of branching factorizations of the least integer of each prime signature (A025487).at n=34A366884