Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with domination number k, n >= 1, 1 <= k <= A065033(n+1).
A332401
Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with domination number k, n >= 1, 1 <= k <= A065033(n+1).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =2a(5) =11a(6) =10a(7) =34a(8) =76a(9) =2a(10) =156a(11) =655a(12) =42a(13) =1044a(14) =9162a(15) =905a(16) =6a(17) =12346a(18) =219823a(19) =28720a(20) =191a(21) =274668a(22) =9864065a(23) =1568173a(24) =9644a(25) =21
External references
- oeis: A332401