90842

Appears in sequences

• Number of connected triangle-free graphs on n unlabeled nodes.at n=10A024607
• Triangle read by rows: T(n,k) gives number of connected graphs on n nodes with clique number n-k, (n>=2, k=0..n-2).at n=54A126744
• Number T(n,k) of triangle-free graphs on n unlabeled nodes with exactly k connected components; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=67A283417
• a(n) = A005117(A390138(n) + 1).at n=29A390241