27816
domain: N
Appears in sequences
- a(n) = T(2n+3,n), array T as in A055818.at n=5A055827
- Main diagonal of rectangular table A121424.at n=5A121425
- Number of subpartitions of partition P=[0,1,1,2,2,2,3,3,3,3,4,...] (A003056).at n=20A121430
- Number of minimally strongly connected digraphs on n labeled vertices.at n=4A130768
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, -1), (1, 0, 1), (1, 1, 0)}.at n=8A150412
- Number of 3Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=9A207243
- G.f. A(x) satisfies: 1 = Product_{n>=1} (1 - A(x)^n) * (1 - A(x)^n*x) * (1 - A(x)^(n-1)/x).at n=8A268650
- Number of weakly unimodal compositions of n in which the greatest part occurs exactly seven times.at n=57A320318
- a(n) = Sum_{k = 0..n} (-4)^(n-k)*binomial(n,k)*binomial(3*n+k,k)*binomial(2*k,k).at n=4A363987