49440

Appears in sequences

• Result of using the positive integers 1,2,3,... as coefficients in an infinite polynomial series in x and then expressing this series as Product_{k>=1} (1+a(k)x^k).at n=39A147654
• Number of 3-step king's tours on an n X n board summed over all starting positions.at n=30A186862
• Number of 0..n arrays x(0..6) of 7 elements with zero 4th differences.at n=42A200274
• Number of (2+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=14A252534
• Constant term in the expansion of ((x^3 + x + 1/x + 1/x^3)*(y^3 + y + 1/y + 1/y^3) - (x + 1/x)*(y + 1/y))^(2*n).at n=3A329024
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) is the constant term in the expansion of ( (Sum_{j=0..n} x^(2*j+1)+1/x^(2*j+1)) * (Sum_{j=0..n} y^(2*j+1)+1/y^(2*j+1)) - (Sum_{j=0..n-1} x^(2*j+1)+1/x^(2*j+1)) * (Sum_{j=0..n-1} y^(2*j+1)+1/y^(2*j+1)) )^(2*k).at n=11A329066
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) is the number of k-step closed paths (from origin to origin) in 2-dimensional lattice, using steps (t_1,t_2) (|t_1| + |t_2| = n).at n=48A329078
• a(n) is the number of graceful graphs with n edges and round(sqrt(3n+9/4)) vertices.at n=18A343296
• a(n) = Sum_{k=3..n} binomial(k,3) * floor(n/k).at n=32A366971