45516

Appears in sequences

• Number of oriented n-dimensional polytopes with n+3 vertices, meaning that two polytopes are identified if they have the same combinatorial type and there exists an orientation-preserving homeomorphism mapping the first polytope to the second polytope.at n=9A114290
• Number of (n+2)X(n+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=3A252361
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=3A252365
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=24A252369
• The number of gaps in the set of positive integers which need at most n steps of the Collatz iteration to reach 1.at n=42A391769