47356

Appears in sequences

• Number of triangular nXnXn arrays of occupancy after each element either stays or moves to some neighbor and with no occupancy greater than 5.at n=3A217507
• T(n,k) is the number of triangular n X n X n arrays of occupancy after each element either stays or moves to some neighbor and with no occupancy greater than k.at n=31A217510
• Number of unlabeled connected simple graphs with n nodes of degree 4 or less and with at least a cyclic structure and a node of degree one.at n=9A289991