97580

Appears in sequences

• Number of ways to place 5 nonattacking knights on an n X n board.at n=5A172136
• Number of n X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207711
• Number of nX5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207714
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=40A207717
• Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207720
• Number T(n,k) of ways to place k nonattacking knights on an n X n board; triangle T(n,k), n>=0, 0<=k<=A030978(n), read by rows.at n=42A244081
• Number of n X 2 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,0) and new values introduced in order 0..2.at n=12A275222
• Number of unitary factorizations of Heinz numbers of integer partitions of n. Number of multiset partitions of integer partitions of n with pairwise disjoint blocks.at n=28A305106
• Number of nX7 0..1 arrays with every element unequal to 0, 1, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=10A318081
• a(n) = Sum_{k=3..n} binomial(k,3) * floor(n/k).at n=38A366971