92011

Appears in sequences

• Number of (n+7)X1 arrays of occupancy after each element moves up to +-7 places but not 0.at n=2A222554
• T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0.at n=38A222555
• Number of (n+3)X1 arrays of occupancy after each element moves up to +-n places but not 0.at n=6A222557
• Number of nX3 0..2 arrays with exactly floor(nX3/2) elements equal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=4A223111
• T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=25A223114
• Number of 5Xn 0..2 arrays with exactly floor(5Xn/2) elements equal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=2A223118
• a(n) = Product p_{n*i}^e_i if the prime factorization of n is Product p_i^e_i.at n=25A352028