43914

Appears in sequences

• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k UHD's, where U=(1,1),H=(1,0),D=(1,-1) (0<=k<=floor(n/3)).at n=41A114583
• a(n) = (8 - 2*n + 11*n^2 - 6*n^3 + n^4)/4.at n=21A289121
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A213108.at n=62A384801