26996

Appears in sequences

• Number of Hamiltonian paths in P_5 X P_n.at n=5A003778
• n^3*a(n) is the number of circles in complex projective plane tangent to three smooth curves of degree n in general position.at n=28A030653
• Number of Hamiltonian paths in P_6 X P_n.at n=4A145402
• Number of idempotent 4X4 0..n matrices of rank 3.at n=13A224335
• Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=3A252100
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=2A252101
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=17A252105
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=18A252105
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 211", based on the 5-celled von Neumann neighborhood.at n=34A270899
• Array read by antidiagonals: T(m,n) is the number of (undirected) Hamiltonian paths in the m X n grid graph.at n=49A332307
• Array read by antidiagonals: T(m,n) is the number of (undirected) Hamiltonian paths in the m X n grid graph.at n=50A332307
• Main diagonal of array in A358298.at n=25A358301
• Number of degree 2 vertices in the n-Sierpinski carpet graph.at n=5A365606
• Triangle read by rows: T(n,k) is the number of paths traveling orthogonally on an n X k grid that visit every cell.at n=19A366399