347993910

Appears in sequences

• a(n) = 3*(2*n)!/((n+2)!*(n-1)!).at n=17A000245
• a(n) = T(n, floor(n/2)), where T = Catalan triangle (A008315).at n=33A026008
• T(n,n-3), array T as in A047040; T(n-3,n), array T given by A047050.at n=16A047045
• T(2n+5,n), array T as in A051168; a count of Lyndon words.at n=16A050183
• a(n) = 3*binomial(2n, n-1)/(n+2), n > 0, with a(0)=1.at n=17A071724
• Row sums of the inverse of number triangle A(n,k) = 1/C(n) if k <= n <= 2k, 0 otherwise, where C(n) = A000108(n).at n=18A127768
• a(n) = 3*C(4*n-2,2*n)/(2*n+1) - 2*0^n.at n=9A127769
• Number of admissible sequences of order j; related to 5x+1 problem.at n=15A174795
• a(n) = binomial(10*n + 7, 5*n + 1)/(10*n + 7).at n=3A265103
• A(n,k) = binomial((2*k+1)*n+2, k*n+1)/((2*k+1)*n+2), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.at n=41A306444
• Number of n element multisets of length 4 vectors over GF(2) that sum to zero.at n=21A363350
• Arises from enumeration of a certain class of partial zig-zag knight's paths on the square grid.at n=33A368379