40064

Appears in sequences

• a(n) is the total squared perimeter of all self-avoiding polygons of area n on the square lattice.at n=5A056633
• Number of permutations that avoid the generalized pattern 12345-6.at n=8A071088
• a(n) = n! - 2^n.at n=8A123642
• Numbers of the form (24*x + 1)*2^(y+6) with positive integers x and y.at n=22A231203
• Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal.at n=3A237235
• Number of (n+1)X(4+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal.at n=0A237238
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal.at n=6A237241
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock equal.at n=9A237241
• Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=11A252528
• a(n) is the smallest number which can be represented as the sum of n distinct n-almost primes in exactly n ways, or -1 if no such number exists.at n=9A365494