490776

Appears in sequences

• Let df(n,k) = Product_{i=0..k-1} (n-i) be the descending factorial and let P(m,n) = df(n-1,m-1)^2*(2*n-m)/((m-1)!*m!). Sequence gives P(4,n).at n=13A132458
• Number of ways to place 3 nonattacking bishops on an n X n toroidal board.at n=12A177756
• Number of collinear point 7-tuples in an n X n X n cubical grid.at n=11A178265
• Number of non-attacking placements of 3 rooks on an n X n board.at n=12A179058
• Number of minimum total dominating sets in the n X n rook complement graph.at n=12A303212