163350

Appears in sequences

• a(n) = t(n)*t(n+1)*t(n+2), where t() are the triangular numbers.at n=9A071910
• Number of ways to place 3 nonattacking bishops on an n X n toroidal board.at n=10A177756
• Expansion of e.g.f. 3*x*exp(x)*(exp(x)-1)^2.at n=9A178759
• Number of non-attacking placements of 3 rooks on an n X n board.at n=10A179058
• Triangle a(n,k) = binomial(n,k)*binomial(n+1,k+1)*binomial(n+2,k+2) read by rows.at n=63A187552
• Number of nX1 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=24A203631
• a(n) = F(n)^3 - F(n)^2, where F(n) is the n-th Fibonacci number (A000045).at n=10A244309
• Expansion of Product_{k>=1} ((1 + 2*x^k) * (1 + 3*x^k)).at n=20A266820
• Number of minimum total dominating sets in the n X n rook complement graph.at n=10A303212
• a(n) is the number of subsets of {1..n} that contain 4 even and 4 odd numbers.at n=23A331575
• Triangle read by rows. T(n, k) = (n - k + 1) * binomial(n + k + 1, 2*k)^2 / (n + k + 1).at n=47A370233