35116
domain: N
Appears in sequences
- Number of n X 5 binary arrays with all 1s connected, a path of 1s from top row to bottom row, and no 1 having more than two 1s adjacent.at n=5A163717
- Number of n X 6 binary arrays with all 1s connected, a path of 1s from left column to right column, and no 1 having more than two 1s adjacent.at n=4A163727
- Numbers k such that the decimal expansions of both k and k^2 have 1 as smallest digit and 6 as largest digit.at n=29A257197
- Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from top row to bottom row, and no 1 having more than two 1's adjacent.at n=50A391822
- Array read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the k*n boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of edges in the resulting planar graph.at n=37A392282