28942
domain: N
Appears in sequences
- Number of partitions of n for which 2*(number of distinct parts) <= (number of parts).at n=41A237363
- Number of n X 5 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.at n=6A240516
- Number of nX7 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.at n=4A240518
- T(n,k)=Number of nXk 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.at n=59A240519
- Row sums of A285117: a(n) = 2 + Sum_{k=1..(n-1)} C(n-1,k-1) XOR C(n-1,k), a(0) = 1, a(1) = 2.at n=16A285114
- Number of edge subsets E of the 3 X n grid graph such that E contains a path between the top left node and the bottom right node.at n=3A349596
- Number of 4 X n mazes that can be navigated from the top left corner to the bottom right corner.at n=2A365629
- Triangle read by rows: T(n,k) is the number of edge subsets E of the n X k grid graph such that E contains a path between the top left node and the bottom right node, 1 <= k <= n.at n=8A373036