94287120

Appears in sequences

• a(n) = 3*(2*n)!/((n+2)!*(n-1)!).at n=16A000245
• a(n) = T(n, floor(n/2)), where T = Catalan triangle (A008315).at n=31A026008
• a(n) = 3*binomial(2n, n-1)/(n+2), n > 0, with a(0)=1.at n=16A071724
• Largest gcd of two distinct numbers on row n of Pascal's triangle.at n=30A092394
• a(0) = 1; for n>0, if gcd(a(n-1),n) = 1 then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.at n=34A094299
• Isomers of polyenes attached to benzene (see Cyvin et al. for precise definition).at n=31A121094
• a(1) = 1 and for any n > 1, if A330647(n) divides a(n-1) then a(n) = a(n-1) / A330647(n), otherwise a(n) = a(n-1) * A330647(n).at n=31A330648
• Arises from enumeration of a certain class of partial zig-zag knight's paths on the square grid.at n=31A368379