61668

Appears in sequences

• Number of ways to place 3 nonattacking kings on an n X n toroidal board.at n=8A179404
• Number of 8-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=3A187863
• Number of (n+1)X(2+1) 0..2 arrays with the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=3A238040
• Number of (n+1)X(4+1) 0..2 arrays with the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A238042
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=11A238046
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=13A238046
• Deep factorization of n, A300560, converted from binary to decimal. (Binary digits obtained by recursively replacing each factor p^e with [primepi(p) [e]], then '[' = 1, ']' = 0.)at n=11A300561
• a(n) = Sum_{k=1..n-1} lcm(lcm(n, k), lcm(n, n-k)).at n=26A338798
• Number of ways to write n as an ordered sum of 9 primes (counting 1 as a prime).at n=15A341988