26077

Appears in sequences

• a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+1), with T given by A026758.at n=7A027232
• Numbers whose set of base-12 digits is {1,3}.at n=38A032919
• a(n) = T(6,n), array T given by A048505.at n=8A048511
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2.at n=34A214510
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=14A214605
• Length of longest chain of nonempty proper subsemigroups of the monoid of partial injective orientation-preserving functions of a chain with n elements.at n=7A242432
• a(n) is the numerator of Sum_{k = 0..n} fusc(k)/fusc(k+1) (where fusc is Stern's diatomic series A002487).at n=23A355075
• Array read by antidiagonals: T(m,n) is the number of connected dominating sets in the rook graph K_m X K_n.at n=23A360875
• Array read by antidiagonals: T(m,n) is the number of connected dominating sets in the rook graph K_m X K_n.at n=25A360875