1565109

Appears in sequences

• Number of subsets of the set {1,2,...,n} which do not contain two elements whose difference is 5.at n=28A208742
• Number of nX3 array permutations with every element making zero or one right-handed knight moves (out 2, right 1).at n=10A209538
• Triangle where g.f. S = S(x,m) satisfies: S = x/(G(-S^2)*G(-m*S^2)) such that G(x) = 1 + x*G(x)^2 is the g.f. of the Catalan numbers (A000108), as read by rows of coefficients T(n,k) of x^(2*n-1)*m^k in S(x,m) for n>=1, k=0..n-1.at n=60A278880
• a(n) = (4*n+1) * ( binomial(3*n,n)/(2*n+1) )^2.at n=5A278883
• a(n) = Fibonacci(n)^2 * Fibonacci(n+1)^3.at n=7A363476