29224

Appears in sequences

• 3-apexes of Omega: numbers k such that Omega(k-3) < Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2) > Omega(k+3), where Omega(m) = the number of prime factors of m, counting multiplicity.at n=6A076760
• An inverse Chebyshev transform of x/(1-2x).at n=12A100099
• Number of cycles of length 4 in the queen graph associated with an n X n chessboard.at n=8A156001
• Coefficients of a Hermite-like polynomial from Eulerian polynomials: p(x,n) = Sum_{k=1..n+1} [Eulerian(n + 1, k - 1)*x^(k - 1)]; q(x,n) = p''(x,n) - x*p'(x,n) + n*p(x,n).at n=28A171633
• Number of (n+1) X 2 binary arrays with no 2 X 2 subblock trace equal to any horizontal or vertical neighbor 2 X 2 subblock trace.at n=8A185761
• T(n,k)=Number of (n+1)X(k+1) binary arrays with no 2X2 subblock trace equal to any horizontal or vertical neighbor 2X2 subblock trace.at n=36A185769
• Numbers k such that Sum_{j=1..k} sigma(j)^j == 0 (mod k).at n=6A229208
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=28A235017
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=35A235017
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=36A253698
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=44A253698
• Number of distinct length-n necklaces on a size-2 alphabet.at n=38A344779