984064

Appears in sequences

• Number of ways to place a non-attacking white and black rook on n X n chessboard.at n=31A035287
• T(n,k) = (floor(k*n/2) * ceiling(k*n/2))^2, triangular array read by rows, 1 <= k <= n.at n=42A089083
• n, ps(n), ps^2(n), ..., ps^9(n) forms an increasing ps-sequence of length 10.at n=24A158918
• Numbers with 33 divisors.at n=10A175743
• Number of n X 6 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=15A208067
• Smallest Product_{i:lambda} prime(i) for any perfect partition lambda of n.at n=32A259939
• Numbers k that divide A003714(k).at n=18A276488
• a(n) = M(n)^2*(M(n)+1)^2, where M(n) = A000668(n) is the n-th Mersenne prime.at n=2A330837
• Squares whose base-3 expansion has no 0.at n=29A363428
• Perfect powers k such that A052409(k) is equal to A052409(A366275(k)).at n=39A366278
• "Late birds" in A390939: terms A390939(m) such that A390939(k) > A390939(m) for all k > m, where A390939 lists the keys added in the map initialized with T[1] = 1 and then repeatedly T[v] := k + (T[v] if defined else 0) for all key-value pairs (k, v) in T.at n=26A390941