Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with irredundance number k.

A332404

Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with irredundance number k.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =4a(7) =5a(8) =1a(9) =1a(10) =11a(11) =16a(12) =5a(13) =1a(14) =1a(15) =34a(16) =94a(17) =21a(18) =5a(19) =1a(20) =1a(21) =156a(22) =710a(23) =150a(24) =21a(25) =5a(26) =1a(27) =1a(28) =1044a(29) =9419

External references