26372

Appears in sequences

• Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the line y=x (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps (E=1,0), N=(0,1) and D(1,1)).at n=49A109979
• Expansion of 1/(sqrt(1-2*x-3*x^2)*(2-M(x))), where M(x) is the g.f. of the Motzkin numbers A001006.at n=9A116387
• Number of (w,x,y,z) with all terms in {1,...,n} and |x-y| = w + |y-z|.at n=38A212683
• Number of (n+3) X 10 0..1 matrices with each 4 X 4 subblock idempotent.at n=15A224567
• Number of partitions p of n such that mean(p) < multiplicity(min(p)).at n=42A240203
• Number of unlabeled connected loopless multigraphs with n edges rooted at one distinguished vertex.at n=9A339036