27794

Appears in sequences

• Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.at n=40A084269
• Triangle read by rows: T(n,k) (n>=2, k=2..n) gives number of connected graphs on n nodes with chromatic number n-k+1.at n=32A126736
• Number of connected graphs on n nodes with chromatic number 5.at n=8A126739
• Tropical version of the degree-6 recurrence x(n+6)*x(n) = (x(n+5)*x(n+1))^2 + x(n+4)^2*x(n+3)^4*x(n+2)^2.at n=20A220839
• Number of integer partitions of n whose Durfee square has sides of even size.at n=42A274523
• Number of chiral pairs of color patterns (set partitions) in a cycle of length n using 3 or fewer colors (subsets).at n=13A320743
• G.f. satisfies A(x) = exp( Sum_{k>=1} A(x^k) * x^k/(k * (1 - x^k)^3) ).at n=8A363548