Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with upper domination number k.
A332403
Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with upper domination number k.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =6a(8) =3a(9) =1a(10) =1a(11) =13a(12) =15a(13) =4a(14) =1a(15) =1a(16) =36a(17) =83a(18) =30a(19) =5a(20) =1a(21) =1a(22) =101a(23) =582a(24) =302a(25) =51a(26) =6a(27) =1a(28) =1a(29) =365
External references
- oeis: A332403