23091

Appears in sequences

• Position of first occurrence of 2^n in A057923.at n=22A057925
• Position at which 2^n occurs in A057926, or -1 if it does not occur.at n=23A057928
• a(n) = prime(n) * prime(n+2) - 2 * prime(n+1).at n=34A152532
• Number of n X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=5A207301
• Number of n X 6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=5A207303
• Number of 6Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=5A207309
• Number of (n+2) X (2+2) 0..2 arrays with every 3 X 3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4.at n=6A252069
• Number of (n+2)X(7+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4.at n=1A252074
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4.at n=29A252075
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4.at n=34A252075
• G.f. A(x) satisfies: A( x*A(x) - x*A(x)^2 ) = x^2.at n=11A265940
• Number of compositions of 7*n into parts 4 and 7.at n=13A373910