36116

Appears in sequences

• Cost of traversing leftmost tree of height n through splaying.at n=12A100625
• Number of defective 4-colorings of an n X n 0..3 array connected horizontally, antidiagonally and vertically with exactly one mistake, and colors introduced in row-major 0..3 order.at n=3A229471
• Number of defective 4-colorings of an n X 4 0..3 array connected horizontally, antidiagonally and vertically with exactly one mistake, and colors introduced in row-major 0..3 order.at n=3A229475
• T(n,k) = number of defective 4-colorings of an n X k 0..3 array connected horizontally, antidiagonally and vertically with exactly one mistake, and colors introduced in row-major 0..3 order.at n=24A229479
• Given the associative array U(n,k) described below, numbers m > 5 such that [m-3..m+3] are not in U(n,k) (excluding the first row and column).at n=14A345473