181568

Appears in sequences

• Irregular triangle read by rows: T(n,k) is the number of connected permutation graphs on n vertices with domination number k, with 1 <= k <= floor(n/2).at n=18A320583
• Irregular triangle read by rows: T(n,k) is the number of chordless cycles of length k in the n-diagonal intersection graph, 4 <= k <= kmax.at n=55A371340