47640

Appears in sequences

• Number of 4-step left-handed knight's tours (moves only out two, left one) on an n X n board summed over all starting positions.at n=39A187174
• Number of n X n 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two exactly once.at n=3A268632
• Number of n_X_4 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two exactly once.at n=3A268635
• T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two exactly once.at n=24A268639
• Triangle read by rows: T(n,k) is the number of planar tanglegrams of size n with 0 <= k < n leaf-matched pairs. A leaf matched pair is a pair of non-leaf vertices (u,v) in the tanglegram such that the induced subtrees rooted and u and v also form a tanglegram (equivalently, the leaves in these two subtrees are matched by the matching that forms the original tanglegram).at n=40A349409