408105

Appears in sequences

• a(n) = Sum_{k=0..n} binomial(n,k)*binomial(2*k,k).at n=9A026375
• a(n) = T(n,[ n/2 ]), where T is the array in A026374.at n=17A026380
• Riordan array (1/sqrt(1-6x+5x^2),(1-3x-sqrt(1-6x+5x^2))/(2x)).at n=45A110165
• 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=25A110221
• Riordan array (1/sqrt(1-6x+5x^2),x/(1-6x+5x^2)).at n=45A111965
• Number of nX6 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-1) and new values introduced in order 0..2.at n=4A276297
• T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-1) and new values introduced in order 0..2.at n=49A276299
• Number of 5Xn 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-1) and new values introduced in order 0..2.at n=5A276302
• Number of branching factorizations of the least integer of each prime signature (A025487).at n=45A366884