Triangle read by rows: T(n,k) is the number of simple connected graphs on n vertices having independence number k.
A294490
Triangle read by rows: T(n,k) is the number of simple connected graphs on n vertices having independence number k.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =4a(8) =1a(9) =0a(10) =1a(11) =11a(12) =8a(13) =1a(14) =0a(15) =1a(16) =34a(17) =63a(18) =13a(19) =1a(20) =0a(21) =1a(22) =103a(23) =524a(24) =205a(25) =19a(26) =1a(27) =0a(28) =1a(29) =405
External references
- oeis: A294490