399849
domain: N
Appears in sequences
- Minimum number of moves to solve the first Panex puzzle of order n of transferring a side tower to the center column.at n=14A109175
- Minimum number of moves to solve a variant of the first Panex puzzle of order n of transferring a side tower to the center column.at n=14A115185
- Number of nX6 0..3 arrays with no more than floor(nX6/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=1A222876
- T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=22A222878
- Number of 2Xn 0..3 arrays with no more than floor(2Xn/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=5A222879