115438

Appears in sequences

• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 3 6 or 7.at n=23A252257
• Number of (n+2)X(n+2) 0..3 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=5A253036
• Number of (n+2)X(6+2) 0..3 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=5A253042
• Number of sets of exactly four nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=7A293966
• Number of equivalence classes (up to graph homeomorphism) of finite graphs that have an embedding in an orientable surface of genus n which minimally separates the surface of genus n (that is, no proper subset of the embedding separates the genus n surface) but not the surface of genus n-1.at n=5A387066