410571

Appears in sequences

• Number of simple graphs on n vertices with each component regular.at n=12A165647
• Number of permutations of 1..n with displacements restricted to {-6,-5,-4,0,1,2,3}.at n=14A189599
• Number of nX3 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=4A221358
• Number of nX5 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=2A221360
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=23A221361
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=25A221361