Triangle read by rows, 1 <= k <= n: T(n,k) is the number of (unlabeled) connected graphs with n nodes and zero forcing number k.

A343648

Triangle read by rows, 1 <= k <= n: T(n,k) is the number of (unlabeled) connected graphs with n nodes and zero forcing 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) =10a(12) =9a(13) =1a(14) =0a(15) =1a(16) =33a(17) =58a(18) =19a(19) =1a(20) =0a(21) =1a(22) =94a(23) =457a(24) =266a(25) =34a(26) =1a(27) =0a(28) =1a(29) =319

External references